/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/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/mannadiv_unwindbound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 14:18:34,781 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 14:18:34,807 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 14:18:34,855 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 14:18:34,856 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 14:18:34,857 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 14:18:34,860 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 14:18:34,862 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 14:18:34,864 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 14:18:34,868 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 14:18:34,868 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 14:18:34,870 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 14:18:34,870 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 14:18:34,872 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 14:18:34,872 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 14:18:34,875 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 14:18:34,875 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 14:18:34,876 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 14:18:34,878 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 14:18:34,883 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 14:18:34,884 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 14:18:34,885 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 14:18:34,886 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 14:18:34,887 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 14:18:34,888 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 14:18:34,894 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 14:18:34,894 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 14:18:34,895 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 14:18:34,895 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 14:18:34,896 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 14:18:34,896 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 14:18:34,897 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 14:18:34,898 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 14:18:34,898 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 14:18:34,899 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 14:18:34,900 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 14:18:34,900 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 14:18:34,900 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 14:18:34,900 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 14:18:34,901 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 14:18:34,901 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 14:18:34,903 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 14:18:34,903 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 14:18:34,931 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 14:18:34,931 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 14:18:34,931 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 14:18:34,931 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 14:18:34,932 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 14:18:34,932 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 14:18:34,933 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 14:18:34,933 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 14:18:34,933 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 14:18:34,934 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 14:18:34,934 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 14:18:34,934 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 14:18:34,934 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 14:18:34,934 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 14:18:34,934 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 14:18:34,934 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 14:18:34,934 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 14:18:34,935 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 14:18:34,935 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 14:18:34,935 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 14:18:34,935 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 14:18:34,935 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 14:18:34,935 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 14:18:34,935 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 14:18:34,935 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 14:18:34,936 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 14:18:34,936 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 14:18:34,936 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 14:18:34,936 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 14:18:34,936 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 14:18:34,936 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 14:18:34,936 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 14:18:34,936 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 14:18:34,937 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 14:18:35,144 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 14:18:35,168 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 14:18:35,170 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 14:18:35,171 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 14:18:35,175 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 14:18:35,176 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/mannadiv_unwindbound10.c [2022-04-27 14:18:35,224 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22d56697c/46a1220d230541339259ce3b0ece66c0/FLAG191c93e11 [2022-04-27 14:18:35,574 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 14:18:35,574 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/mannadiv_unwindbound10.c [2022-04-27 14:18:35,579 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22d56697c/46a1220d230541339259ce3b0ece66c0/FLAG191c93e11 [2022-04-27 14:18:36,010 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22d56697c/46a1220d230541339259ce3b0ece66c0 [2022-04-27 14:18:36,011 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 14:18:36,012 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 14:18:36,014 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 14:18:36,014 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 14:18:36,021 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 14:18:36,022 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 02:18:36" (1/1) ... [2022-04-27 14:18:36,022 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ab315e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:18:36, skipping insertion in model container [2022-04-27 14:18:36,023 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 02:18:36" (1/1) ... [2022-04-27 14:18:36,028 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 14:18:36,038 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 14:18:36,175 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_unwindbound10.c[573,586] [2022-04-27 14:18:36,187 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 14:18:36,194 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 14:18:36,204 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_unwindbound10.c[573,586] [2022-04-27 14:18:36,209 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 14:18:36,218 INFO L208 MainTranslator]: Completed translation [2022-04-27 14:18:36,218 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:18:36 WrapperNode [2022-04-27 14:18:36,218 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 14:18:36,219 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 14:18:36,219 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 14:18:36,219 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 14:18:36,226 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:18:36" (1/1) ... [2022-04-27 14:18:36,226 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:18:36" (1/1) ... [2022-04-27 14:18:36,231 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:18:36" (1/1) ... [2022-04-27 14:18:36,231 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:18:36" (1/1) ... [2022-04-27 14:18:36,236 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:18:36" (1/1) ... [2022-04-27 14:18:36,240 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:18:36" (1/1) ... [2022-04-27 14:18:36,243 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:18:36" (1/1) ... [2022-04-27 14:18:36,245 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 14:18:36,246 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 14:18:36,246 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 14:18:36,246 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 14:18:36,247 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:18:36" (1/1) ... [2022-04-27 14:18:36,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 14:18:36,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:18:36,272 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 14:18:36,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 14:18:36,316 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 14:18:36,316 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 14:18:36,317 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 14:18:36,317 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 14:18:36,317 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 14:18:36,318 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 14:18:36,318 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 14:18:36,318 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 14:18:36,318 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 14:18:36,318 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 14:18:36,318 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 14:18:36,318 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 14:18:36,318 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 14:18:36,318 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 14:18:36,318 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 14:18:36,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 14:18:36,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 14:18:36,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 14:18:36,319 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 14:18:36,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 14:18:36,369 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 14:18:36,370 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 14:18:36,550 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 14:18:36,556 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 14:18:36,556 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 14:18:36,557 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 02:18:36 BoogieIcfgContainer [2022-04-27 14:18:36,558 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 14:18:36,559 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 14:18:36,559 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 14:18:36,589 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 14:18:36,590 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 02:18:36" (1/3) ... [2022-04-27 14:18:36,590 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3696a1b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 02:18:36, skipping insertion in model container [2022-04-27 14:18:36,590 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:18:36" (2/3) ... [2022-04-27 14:18:36,591 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3696a1b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 02:18:36, skipping insertion in model container [2022-04-27 14:18:36,591 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 02:18:36" (3/3) ... [2022-04-27 14:18:36,592 INFO L111 eAbstractionObserver]: Analyzing ICFG mannadiv_unwindbound10.c [2022-04-27 14:18:36,603 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 14:18:36,603 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 14:18:36,653 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 14:18:36,669 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@42981c30, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@34cdfaf9 [2022-04-27 14:18:36,669 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 14:18:36,677 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-27 14:18:36,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 14:18:36,683 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:18:36,683 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:18:36,684 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:18:36,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:18:36,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1859024204, now seen corresponding path program 1 times [2022-04-27 14:18:36,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:18:36,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503466435] [2022-04-27 14:18:36,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:18:36,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:18:36,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:18:36,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 14:18:36,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:18:36,903 INFO L290 TraceCheckUtils]: 0: Hoare triple {46#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {33#true} is VALID [2022-04-27 14:18:36,903 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-27 14:18:36,903 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33#true} {33#true} #67#return; {33#true} is VALID [2022-04-27 14:18:36,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 14:18:36,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:18:36,918 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-04-27 14:18:36,919 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume 0 == ~cond;assume false; {34#false} is VALID [2022-04-27 14:18:36,920 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#false} assume true; {34#false} is VALID [2022-04-27 14:18:36,920 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#false} {33#true} #59#return; {34#false} is VALID [2022-04-27 14:18:36,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 14:18:36,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:18:36,936 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-04-27 14:18:36,937 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume 0 == ~cond;assume false; {34#false} is VALID [2022-04-27 14:18:36,937 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#false} assume true; {34#false} is VALID [2022-04-27 14:18:36,937 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#false} {34#false} #61#return; {34#false} is VALID [2022-04-27 14:18:36,939 INFO L272 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {46#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 14:18:36,939 INFO L290 TraceCheckUtils]: 1: Hoare triple {46#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {33#true} is VALID [2022-04-27 14:18:36,940 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-27 14:18:36,940 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} #67#return; {33#true} is VALID [2022-04-27 14:18:36,940 INFO L272 TraceCheckUtils]: 4: Hoare triple {33#true} call #t~ret7 := main(); {33#true} is VALID [2022-04-27 14:18:36,940 INFO L290 TraceCheckUtils]: 5: Hoare triple {33#true} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {33#true} is VALID [2022-04-27 14:18:36,941 INFO L272 TraceCheckUtils]: 6: Hoare triple {33#true} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {33#true} is VALID [2022-04-27 14:18:36,941 INFO L290 TraceCheckUtils]: 7: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-04-27 14:18:36,941 INFO L290 TraceCheckUtils]: 8: Hoare triple {33#true} assume 0 == ~cond;assume false; {34#false} is VALID [2022-04-27 14:18:36,941 INFO L290 TraceCheckUtils]: 9: Hoare triple {34#false} assume true; {34#false} is VALID [2022-04-27 14:18:36,942 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {34#false} {33#true} #59#return; {34#false} is VALID [2022-04-27 14:18:36,942 INFO L272 TraceCheckUtils]: 11: Hoare triple {34#false} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {33#true} is VALID [2022-04-27 14:18:36,942 INFO L290 TraceCheckUtils]: 12: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-04-27 14:18:36,942 INFO L290 TraceCheckUtils]: 13: Hoare triple {33#true} assume 0 == ~cond;assume false; {34#false} is VALID [2022-04-27 14:18:36,943 INFO L290 TraceCheckUtils]: 14: Hoare triple {34#false} assume true; {34#false} is VALID [2022-04-27 14:18:36,943 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {34#false} {34#false} #61#return; {34#false} is VALID [2022-04-27 14:18:36,944 INFO L290 TraceCheckUtils]: 16: Hoare triple {34#false} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {34#false} is VALID [2022-04-27 14:18:36,944 INFO L290 TraceCheckUtils]: 17: Hoare triple {34#false} assume !true; {34#false} is VALID [2022-04-27 14:18:36,945 INFO L272 TraceCheckUtils]: 18: Hoare triple {34#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {34#false} is VALID [2022-04-27 14:18:36,945 INFO L290 TraceCheckUtils]: 19: Hoare triple {34#false} ~cond := #in~cond; {34#false} is VALID [2022-04-27 14:18:36,945 INFO L290 TraceCheckUtils]: 20: Hoare triple {34#false} assume 0 == ~cond; {34#false} is VALID [2022-04-27 14:18:36,945 INFO L290 TraceCheckUtils]: 21: Hoare triple {34#false} assume !false; {34#false} is VALID [2022-04-27 14:18:36,946 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 14:18:36,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:18:36,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503466435] [2022-04-27 14:18:36,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503466435] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:18:36,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:18:36,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 14:18:36,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608245594] [2022-04-27 14:18:36,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:18:36,954 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-27 14:18:36,956 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:18:36,958 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-27 14:18:36,989 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:18:36,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 14:18:36,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:18:37,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 14:18:37,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 14:18:37,014 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-27 14:18:37,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:18:37,156 INFO L93 Difference]: Finished difference Result 54 states and 72 transitions. [2022-04-27 14:18:37,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 14:18:37,157 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-27 14:18:37,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:18:37,158 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-27 14:18:37,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2022-04-27 14:18:37,169 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-27 14:18:37,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2022-04-27 14:18:37,181 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 72 transitions. [2022-04-27 14:18:37,271 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:18:37,279 INFO L225 Difference]: With dead ends: 54 [2022-04-27 14:18:37,279 INFO L226 Difference]: Without dead ends: 26 [2022-04-27 14:18:37,282 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 14:18:37,284 INFO L413 NwaCegarLoop]: 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-27 14:18:37,285 INFO L414 NwaCegarLoop]: 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-27 14:18:37,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-27 14:18:37,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2022-04-27 14:18:37,314 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:18:37,315 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-27 14:18:37,316 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-27 14:18:37,319 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-27 14:18:37,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:18:37,329 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-04-27 14:18:37,330 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-04-27 14:18:37,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:18:37,331 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:18:37,332 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-27 14:18:37,333 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-27 14:18:37,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:18:37,337 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-04-27 14:18:37,337 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-04-27 14:18:37,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:18:37,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:18:37,338 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:18:37,338 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:18:37,339 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-27 14:18:37,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-04-27 14:18:37,343 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 22 [2022-04-27 14:18:37,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:18:37,344 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-04-27 14:18:37,345 INFO L496 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-27 14:18:37,345 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-04-27 14:18:37,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 14:18:37,346 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:18:37,347 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:18:37,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 14:18:37,347 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:18:37,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:18:37,351 INFO L85 PathProgramCache]: Analyzing trace with hash 243739414, now seen corresponding path program 1 times [2022-04-27 14:18:37,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:18:37,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123843038] [2022-04-27 14:18:37,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:18:37,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:18:37,396 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:18:37,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1132199721] [2022-04-27 14:18:37,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:18:37,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:18:37,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:18:37,407 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:18:37,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 14:18:37,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:18:37,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 14:18:37,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:18:37,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:18:37,671 INFO L272 TraceCheckUtils]: 0: Hoare triple {209#true} call ULTIMATE.init(); {209#true} is VALID [2022-04-27 14:18:37,672 INFO L290 TraceCheckUtils]: 1: Hoare triple {209#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {217#(<= ~counter~0 0)} is VALID [2022-04-27 14:18:37,672 INFO L290 TraceCheckUtils]: 2: Hoare triple {217#(<= ~counter~0 0)} assume true; {217#(<= ~counter~0 0)} is VALID [2022-04-27 14:18:37,673 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {217#(<= ~counter~0 0)} {209#true} #67#return; {217#(<= ~counter~0 0)} is VALID [2022-04-27 14:18:37,674 INFO L272 TraceCheckUtils]: 4: Hoare triple {217#(<= ~counter~0 0)} call #t~ret7 := main(); {217#(<= ~counter~0 0)} is VALID [2022-04-27 14:18:37,674 INFO L290 TraceCheckUtils]: 5: Hoare triple {217#(<= ~counter~0 0)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {217#(<= ~counter~0 0)} is VALID [2022-04-27 14:18:37,675 INFO L272 TraceCheckUtils]: 6: Hoare triple {217#(<= ~counter~0 0)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {217#(<= ~counter~0 0)} is VALID [2022-04-27 14:18:37,675 INFO L290 TraceCheckUtils]: 7: Hoare triple {217#(<= ~counter~0 0)} ~cond := #in~cond; {217#(<= ~counter~0 0)} is VALID [2022-04-27 14:18:37,676 INFO L290 TraceCheckUtils]: 8: Hoare triple {217#(<= ~counter~0 0)} assume !(0 == ~cond); {217#(<= ~counter~0 0)} is VALID [2022-04-27 14:18:37,677 INFO L290 TraceCheckUtils]: 9: Hoare triple {217#(<= ~counter~0 0)} assume true; {217#(<= ~counter~0 0)} is VALID [2022-04-27 14:18:37,677 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {217#(<= ~counter~0 0)} {217#(<= ~counter~0 0)} #59#return; {217#(<= ~counter~0 0)} is VALID [2022-04-27 14:18:37,678 INFO L272 TraceCheckUtils]: 11: Hoare triple {217#(<= ~counter~0 0)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {217#(<= ~counter~0 0)} is VALID [2022-04-27 14:18:37,679 INFO L290 TraceCheckUtils]: 12: Hoare triple {217#(<= ~counter~0 0)} ~cond := #in~cond; {217#(<= ~counter~0 0)} is VALID [2022-04-27 14:18:37,679 INFO L290 TraceCheckUtils]: 13: Hoare triple {217#(<= ~counter~0 0)} assume !(0 == ~cond); {217#(<= ~counter~0 0)} is VALID [2022-04-27 14:18:37,679 INFO L290 TraceCheckUtils]: 14: Hoare triple {217#(<= ~counter~0 0)} assume true; {217#(<= ~counter~0 0)} is VALID [2022-04-27 14:18:37,683 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {217#(<= ~counter~0 0)} {217#(<= ~counter~0 0)} #61#return; {217#(<= ~counter~0 0)} is VALID [2022-04-27 14:18:37,683 INFO L290 TraceCheckUtils]: 16: Hoare triple {217#(<= ~counter~0 0)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {217#(<= ~counter~0 0)} is VALID [2022-04-27 14:18:37,684 INFO L290 TraceCheckUtils]: 17: Hoare triple {217#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {266#(<= |main_#t~post6| 0)} is VALID [2022-04-27 14:18:37,685 INFO L290 TraceCheckUtils]: 18: Hoare triple {266#(<= |main_#t~post6| 0)} assume !(#t~post6 < 10);havoc #t~post6; {210#false} is VALID [2022-04-27 14:18:37,685 INFO L272 TraceCheckUtils]: 19: Hoare triple {210#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {210#false} is VALID [2022-04-27 14:18:37,685 INFO L290 TraceCheckUtils]: 20: Hoare triple {210#false} ~cond := #in~cond; {210#false} is VALID [2022-04-27 14:18:37,686 INFO L290 TraceCheckUtils]: 21: Hoare triple {210#false} assume 0 == ~cond; {210#false} is VALID [2022-04-27 14:18:37,688 INFO L290 TraceCheckUtils]: 22: Hoare triple {210#false} assume !false; {210#false} is VALID [2022-04-27 14:18:37,688 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 14:18:37,688 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 14:18:37,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:18:37,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123843038] [2022-04-27 14:18:37,689 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:18:37,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1132199721] [2022-04-27 14:18:37,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1132199721] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:18:37,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:18:37,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 14:18:37,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544126944] [2022-04-27 14:18:37,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:18:37,695 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-27 14:18:37,695 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:18:37,696 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-27 14:18:37,716 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:18:37,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 14:18:37,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:18:37,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 14:18:37,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 14:18:37,719 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-27 14:18:37,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:18:37,774 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-27 14:18:37,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 14:18:37,774 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-27 14:18:37,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:18:37,775 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-27 14:18:37,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-27 14:18:37,779 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-27 14:18:37,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-27 14:18:37,782 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 38 transitions. [2022-04-27 14:18:37,812 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:18:37,814 INFO L225 Difference]: With dead ends: 34 [2022-04-27 14:18:37,814 INFO L226 Difference]: Without dead ends: 27 [2022-04-27 14:18:37,815 INFO L412 NwaCegarLoop]: 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-27 14:18:37,816 INFO L413 NwaCegarLoop]: 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-27 14:18:37,817 INFO L414 NwaCegarLoop]: 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-27 14:18:37,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-27 14:18:37,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-27 14:18:37,827 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:18:37,827 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-27 14:18:37,827 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-27 14:18:37,828 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-27 14:18:37,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:18:37,830 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-27 14:18:37,830 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-27 14:18:37,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:18:37,830 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:18:37,831 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-27 14:18:37,831 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-27 14:18:37,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:18:37,833 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-27 14:18:37,833 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-27 14:18:37,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:18:37,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:18:37,834 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:18:37,834 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:18:37,834 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-27 14:18:37,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-04-27 14:18:37,836 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 23 [2022-04-27 14:18:37,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:18:37,836 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-04-27 14:18:37,836 INFO L496 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-27 14:18:37,836 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-27 14:18:37,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 14:18:37,837 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:18:37,837 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:18:37,860 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-27 14:18:38,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:18:38,060 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:18:38,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:18:38,061 INFO L85 PathProgramCache]: Analyzing trace with hash 245526874, now seen corresponding path program 1 times [2022-04-27 14:18:38,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:18:38,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292140106] [2022-04-27 14:18:38,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:18:38,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:18:38,081 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:18:38,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [67262513] [2022-04-27 14:18:38,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:18:38,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:18:38,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:18:38,088 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:18:38,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 14:18:38,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:18:38,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-27 14:18:38,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:18:38,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:18:38,303 INFO L272 TraceCheckUtils]: 0: Hoare triple {422#true} call ULTIMATE.init(); {422#true} is VALID [2022-04-27 14:18:38,303 INFO L290 TraceCheckUtils]: 1: Hoare triple {422#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {422#true} is VALID [2022-04-27 14:18:38,303 INFO L290 TraceCheckUtils]: 2: Hoare triple {422#true} assume true; {422#true} is VALID [2022-04-27 14:18:38,303 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {422#true} {422#true} #67#return; {422#true} is VALID [2022-04-27 14:18:38,304 INFO L272 TraceCheckUtils]: 4: Hoare triple {422#true} call #t~ret7 := main(); {422#true} is VALID [2022-04-27 14:18:38,304 INFO L290 TraceCheckUtils]: 5: Hoare triple {422#true} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {422#true} is VALID [2022-04-27 14:18:38,304 INFO L272 TraceCheckUtils]: 6: Hoare triple {422#true} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {422#true} is VALID [2022-04-27 14:18:38,304 INFO L290 TraceCheckUtils]: 7: Hoare triple {422#true} ~cond := #in~cond; {422#true} is VALID [2022-04-27 14:18:38,304 INFO L290 TraceCheckUtils]: 8: Hoare triple {422#true} assume !(0 == ~cond); {422#true} is VALID [2022-04-27 14:18:38,304 INFO L290 TraceCheckUtils]: 9: Hoare triple {422#true} assume true; {422#true} is VALID [2022-04-27 14:18:38,304 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {422#true} {422#true} #59#return; {422#true} is VALID [2022-04-27 14:18:38,305 INFO L272 TraceCheckUtils]: 11: Hoare triple {422#true} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {422#true} is VALID [2022-04-27 14:18:38,305 INFO L290 TraceCheckUtils]: 12: Hoare triple {422#true} ~cond := #in~cond; {463#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 14:18:38,305 INFO L290 TraceCheckUtils]: 13: Hoare triple {463#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {467#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:18:38,306 INFO L290 TraceCheckUtils]: 14: Hoare triple {467#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {467#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:18:38,307 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {467#(not (= |assume_abort_if_not_#in~cond| 0))} {422#true} #61#return; {474#(not (= main_~x2~0 0))} is VALID [2022-04-27 14:18:38,307 INFO L290 TraceCheckUtils]: 16: Hoare triple {474#(not (= main_~x2~0 0))} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {478#(and (= main_~y2~0 0) (= main_~y1~0 0) (not (= main_~x2~0 0)) (= main_~x1~0 main_~y3~0))} is VALID [2022-04-27 14:18:38,308 INFO L290 TraceCheckUtils]: 17: Hoare triple {478#(and (= main_~y2~0 0) (= main_~y1~0 0) (not (= main_~x2~0 0)) (= main_~x1~0 main_~y3~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {478#(and (= main_~y2~0 0) (= main_~y1~0 0) (not (= main_~x2~0 0)) (= main_~x1~0 main_~y3~0))} is VALID [2022-04-27 14:18:38,308 INFO L290 TraceCheckUtils]: 18: Hoare triple {478#(and (= main_~y2~0 0) (= main_~y1~0 0) (not (= main_~x2~0 0)) (= main_~x1~0 main_~y3~0))} assume !!(#t~post6 < 10);havoc #t~post6; {478#(and (= main_~y2~0 0) (= main_~y1~0 0) (not (= main_~x2~0 0)) (= main_~x1~0 main_~y3~0))} is VALID [2022-04-27 14:18:38,309 INFO L272 TraceCheckUtils]: 19: Hoare triple {478#(and (= main_~y2~0 0) (= main_~y1~0 0) (not (= main_~x2~0 0)) (= main_~x1~0 main_~y3~0))} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {488#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:18:38,309 INFO L290 TraceCheckUtils]: 20: Hoare triple {488#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {492#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:18:38,310 INFO L290 TraceCheckUtils]: 21: Hoare triple {492#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {423#false} is VALID [2022-04-27 14:18:38,310 INFO L290 TraceCheckUtils]: 22: Hoare triple {423#false} assume !false; {423#false} is VALID [2022-04-27 14:18:38,310 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-27 14:18:38,310 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 14:18:38,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:18:38,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292140106] [2022-04-27 14:18:38,311 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:18:38,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [67262513] [2022-04-27 14:18:38,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [67262513] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:18:38,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:18:38,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-27 14:18:38,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836068629] [2022-04-27 14:18:38,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:18:38,312 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-27 14:18:38,312 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:18:38,312 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-27 14:18:38,330 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-27 14:18:38,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 14:18:38,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:18:38,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 14:18:38,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-27 14:18:38,331 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-27 14:18:38,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:18:38,562 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-04-27 14:18:38,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 14:18:38,562 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-27 14:18:38,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:18:38,563 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-27 14:18:38,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-27 14:18:38,564 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-27 14:18:38,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-27 14:18:38,566 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 43 transitions. [2022-04-27 14:18:38,615 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:18:38,616 INFO L225 Difference]: With dead ends: 37 [2022-04-27 14:18:38,616 INFO L226 Difference]: Without dead ends: 35 [2022-04-27 14:18:38,617 INFO L412 NwaCegarLoop]: 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-27 14:18:38,618 INFO L413 NwaCegarLoop]: 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-27 14:18:38,618 INFO L414 NwaCegarLoop]: 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-27 14:18:38,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-27 14:18:38,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2022-04-27 14:18:38,641 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:18:38,641 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-27 14:18:38,642 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-27 14:18:38,642 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-27 14:18:38,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:18:38,644 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-04-27 14:18:38,644 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-04-27 14:18:38,644 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:18:38,644 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:18:38,645 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-27 14:18:38,645 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-27 14:18:38,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:18:38,647 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-04-27 14:18:38,647 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-04-27 14:18:38,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:18:38,647 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:18:38,647 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:18:38,647 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:18:38,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:18:38,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2022-04-27 14:18:38,649 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 23 [2022-04-27 14:18:38,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:18:38,649 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2022-04-27 14:18:38,650 INFO L496 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-27 14:18:38,650 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-04-27 14:18:38,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-27 14:18:38,650 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:18:38,651 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:18:38,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 14:18:38,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-27 14:18:38,867 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:18:38,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:18:38,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1019533657, now seen corresponding path program 1 times [2022-04-27 14:18:38,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:18:38,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288978956] [2022-04-27 14:18:38,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:18:38,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:18:38,880 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:18:38,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1595455406] [2022-04-27 14:18:38,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:18:38,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:18:38,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:18:38,882 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:18:38,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-27 14:18:38,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:18:38,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-27 14:18:38,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:18:38,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:18:39,097 INFO L272 TraceCheckUtils]: 0: Hoare triple {670#true} call ULTIMATE.init(); {670#true} is VALID [2022-04-27 14:18:39,097 INFO L290 TraceCheckUtils]: 1: Hoare triple {670#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {670#true} is VALID [2022-04-27 14:18:39,097 INFO L290 TraceCheckUtils]: 2: Hoare triple {670#true} assume true; {670#true} is VALID [2022-04-27 14:18:39,097 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {670#true} {670#true} #67#return; {670#true} is VALID [2022-04-27 14:18:39,098 INFO L272 TraceCheckUtils]: 4: Hoare triple {670#true} call #t~ret7 := main(); {670#true} is VALID [2022-04-27 14:18:39,098 INFO L290 TraceCheckUtils]: 5: Hoare triple {670#true} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {670#true} is VALID [2022-04-27 14:18:39,098 INFO L272 TraceCheckUtils]: 6: Hoare triple {670#true} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {670#true} is VALID [2022-04-27 14:18:39,098 INFO L290 TraceCheckUtils]: 7: Hoare triple {670#true} ~cond := #in~cond; {670#true} is VALID [2022-04-27 14:18:39,098 INFO L290 TraceCheckUtils]: 8: Hoare triple {670#true} assume !(0 == ~cond); {670#true} is VALID [2022-04-27 14:18:39,098 INFO L290 TraceCheckUtils]: 9: Hoare triple {670#true} assume true; {670#true} is VALID [2022-04-27 14:18:39,098 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {670#true} {670#true} #59#return; {670#true} is VALID [2022-04-27 14:18:39,098 INFO L272 TraceCheckUtils]: 11: Hoare triple {670#true} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {670#true} is VALID [2022-04-27 14:18:39,099 INFO L290 TraceCheckUtils]: 12: Hoare triple {670#true} ~cond := #in~cond; {670#true} is VALID [2022-04-27 14:18:39,099 INFO L290 TraceCheckUtils]: 13: Hoare triple {670#true} assume !(0 == ~cond); {670#true} is VALID [2022-04-27 14:18:39,099 INFO L290 TraceCheckUtils]: 14: Hoare triple {670#true} assume true; {670#true} is VALID [2022-04-27 14:18:39,099 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {670#true} {670#true} #61#return; {670#true} is VALID [2022-04-27 14:18:39,099 INFO L290 TraceCheckUtils]: 16: Hoare triple {670#true} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {670#true} is VALID [2022-04-27 14:18:39,099 INFO L290 TraceCheckUtils]: 17: Hoare triple {670#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {670#true} is VALID [2022-04-27 14:18:39,099 INFO L290 TraceCheckUtils]: 18: Hoare triple {670#true} assume !!(#t~post6 < 10);havoc #t~post6; {670#true} is VALID [2022-04-27 14:18:39,099 INFO L272 TraceCheckUtils]: 19: Hoare triple {670#true} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {670#true} is VALID [2022-04-27 14:18:39,100 INFO L290 TraceCheckUtils]: 20: Hoare triple {670#true} ~cond := #in~cond; {735#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:18:39,100 INFO L290 TraceCheckUtils]: 21: Hoare triple {735#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {739#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:18:39,100 INFO L290 TraceCheckUtils]: 22: Hoare triple {739#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {739#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:18:39,101 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {739#(not (= |__VERIFIER_assert_#in~cond| 0))} {670#true} #63#return; {746#(= (+ (* main_~x2~0 main_~y1~0) main_~y3~0 main_~y2~0) main_~x1~0)} is VALID [2022-04-27 14:18:39,102 INFO L290 TraceCheckUtils]: 24: Hoare triple {746#(= (+ (* main_~x2~0 main_~y1~0) main_~y3~0 main_~y2~0) main_~x1~0)} assume !(0 != ~y3~0); {750#(= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0)} is VALID [2022-04-27 14:18:39,103 INFO L272 TraceCheckUtils]: 25: Hoare triple {750#(= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {754#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:18:39,103 INFO L290 TraceCheckUtils]: 26: Hoare triple {754#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {758#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:18:39,103 INFO L290 TraceCheckUtils]: 27: Hoare triple {758#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {671#false} is VALID [2022-04-27 14:18:39,104 INFO L290 TraceCheckUtils]: 28: Hoare triple {671#false} assume !false; {671#false} is VALID [2022-04-27 14:18:39,104 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 14:18:39,104 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:18:45,813 INFO L290 TraceCheckUtils]: 28: Hoare triple {671#false} assume !false; {671#false} is VALID [2022-04-27 14:18:45,814 INFO L290 TraceCheckUtils]: 27: Hoare triple {758#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {671#false} is VALID [2022-04-27 14:18:45,814 INFO L290 TraceCheckUtils]: 26: Hoare triple {754#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {758#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:18:45,815 INFO L272 TraceCheckUtils]: 25: Hoare triple {750#(= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {754#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:18:45,815 INFO L290 TraceCheckUtils]: 24: Hoare triple {777#(or (not (= main_~y3~0 0)) (= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0))} assume !(0 != ~y3~0); {750#(= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0)} is VALID [2022-04-27 14:18:45,816 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {739#(not (= |__VERIFIER_assert_#in~cond| 0))} {670#true} #63#return; {777#(or (not (= main_~y3~0 0)) (= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0))} is VALID [2022-04-27 14:18:45,817 INFO L290 TraceCheckUtils]: 22: Hoare triple {739#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {739#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:18:45,817 INFO L290 TraceCheckUtils]: 21: Hoare triple {790#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {739#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:18:45,818 INFO L290 TraceCheckUtils]: 20: Hoare triple {670#true} ~cond := #in~cond; {790#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 14:18:45,818 INFO L272 TraceCheckUtils]: 19: Hoare triple {670#true} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {670#true} is VALID [2022-04-27 14:18:45,818 INFO L290 TraceCheckUtils]: 18: Hoare triple {670#true} assume !!(#t~post6 < 10);havoc #t~post6; {670#true} is VALID [2022-04-27 14:18:45,818 INFO L290 TraceCheckUtils]: 17: Hoare triple {670#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {670#true} is VALID [2022-04-27 14:18:45,818 INFO L290 TraceCheckUtils]: 16: Hoare triple {670#true} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {670#true} is VALID [2022-04-27 14:18:45,819 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {670#true} {670#true} #61#return; {670#true} is VALID [2022-04-27 14:18:45,819 INFO L290 TraceCheckUtils]: 14: Hoare triple {670#true} assume true; {670#true} is VALID [2022-04-27 14:18:45,819 INFO L290 TraceCheckUtils]: 13: Hoare triple {670#true} assume !(0 == ~cond); {670#true} is VALID [2022-04-27 14:18:45,819 INFO L290 TraceCheckUtils]: 12: Hoare triple {670#true} ~cond := #in~cond; {670#true} is VALID [2022-04-27 14:18:45,819 INFO L272 TraceCheckUtils]: 11: Hoare triple {670#true} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {670#true} is VALID [2022-04-27 14:18:45,819 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {670#true} {670#true} #59#return; {670#true} is VALID [2022-04-27 14:18:45,819 INFO L290 TraceCheckUtils]: 9: Hoare triple {670#true} assume true; {670#true} is VALID [2022-04-27 14:18:45,819 INFO L290 TraceCheckUtils]: 8: Hoare triple {670#true} assume !(0 == ~cond); {670#true} is VALID [2022-04-27 14:18:45,820 INFO L290 TraceCheckUtils]: 7: Hoare triple {670#true} ~cond := #in~cond; {670#true} is VALID [2022-04-27 14:18:45,820 INFO L272 TraceCheckUtils]: 6: Hoare triple {670#true} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {670#true} is VALID [2022-04-27 14:18:45,820 INFO L290 TraceCheckUtils]: 5: Hoare triple {670#true} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {670#true} is VALID [2022-04-27 14:18:45,820 INFO L272 TraceCheckUtils]: 4: Hoare triple {670#true} call #t~ret7 := main(); {670#true} is VALID [2022-04-27 14:18:45,820 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {670#true} {670#true} #67#return; {670#true} is VALID [2022-04-27 14:18:45,820 INFO L290 TraceCheckUtils]: 2: Hoare triple {670#true} assume true; {670#true} is VALID [2022-04-27 14:18:45,820 INFO L290 TraceCheckUtils]: 1: Hoare triple {670#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {670#true} is VALID [2022-04-27 14:18:45,820 INFO L272 TraceCheckUtils]: 0: Hoare triple {670#true} call ULTIMATE.init(); {670#true} is VALID [2022-04-27 14:18:45,821 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 14:18:45,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:18:45,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288978956] [2022-04-27 14:18:45,821 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:18:45,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1595455406] [2022-04-27 14:18:45,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1595455406] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 14:18:45,821 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 14:18:45,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-27 14:18:45,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187399337] [2022-04-27 14:18:45,821 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 14:18:45,822 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-27 14:18:45,822 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:18:45,823 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-27 14:18:45,850 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-27 14:18:45,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 14:18:45,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:18:45,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 14:18:45,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-27 14:18:45,851 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-27 14:18:46,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:18:46,127 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2022-04-27 14:18:46,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 14:18:46,127 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-27 14:18:46,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:18:46,128 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-27 14:18:46,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2022-04-27 14:18:46,129 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-27 14:18:46,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2022-04-27 14:18:46,130 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 35 transitions. [2022-04-27 14:18:46,165 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:18:46,166 INFO L225 Difference]: With dead ends: 39 [2022-04-27 14:18:46,166 INFO L226 Difference]: Without dead ends: 34 [2022-04-27 14:18:46,167 INFO L412 NwaCegarLoop]: 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-27 14:18:46,168 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 17 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:18:46,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 120 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 14:18:46,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-27 14:18:46,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. [2022-04-27 14:18:46,176 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:18:46,176 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-27 14:18:46,176 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-27 14:18:46,177 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-27 14:18:46,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:18:46,178 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-04-27 14:18:46,178 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2022-04-27 14:18:46,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:18:46,179 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:18:46,179 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-27 14:18:46,179 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-27 14:18:46,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:18:46,181 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-04-27 14:18:46,181 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2022-04-27 14:18:46,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:18:46,182 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:18:46,182 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:18:46,182 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:18:46,182 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-27 14:18:46,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2022-04-27 14:18:46,183 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 29 [2022-04-27 14:18:46,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:18:46,184 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2022-04-27 14:18:46,184 INFO L496 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-27 14:18:46,184 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-04-27 14:18:46,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-27 14:18:46,185 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:18:46,185 INFO L195 NwaCegarLoop]: 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-27 14:18:46,209 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-27 14:18:46,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:18:46,399 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:18:46,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:18:46,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1080225052, now seen corresponding path program 1 times [2022-04-27 14:18:46,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:18:46,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327600819] [2022-04-27 14:18:46,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:18:46,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:18:46,424 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:18:46,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1322492200] [2022-04-27 14:18:46,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:18:46,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:18:46,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:18:46,429 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-27 14:18:46,434 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-27 14:18:46,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:18:46,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 14:18:46,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:18:46,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:18:46,630 INFO L272 TraceCheckUtils]: 0: Hoare triple {1024#true} call ULTIMATE.init(); {1024#true} is VALID [2022-04-27 14:18:46,631 INFO L290 TraceCheckUtils]: 1: Hoare triple {1024#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1032#(<= ~counter~0 0)} is VALID [2022-04-27 14:18:46,631 INFO L290 TraceCheckUtils]: 2: Hoare triple {1032#(<= ~counter~0 0)} assume true; {1032#(<= ~counter~0 0)} is VALID [2022-04-27 14:18:46,631 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1032#(<= ~counter~0 0)} {1024#true} #67#return; {1032#(<= ~counter~0 0)} is VALID [2022-04-27 14:18:46,632 INFO L272 TraceCheckUtils]: 4: Hoare triple {1032#(<= ~counter~0 0)} call #t~ret7 := main(); {1032#(<= ~counter~0 0)} is VALID [2022-04-27 14:18:46,632 INFO L290 TraceCheckUtils]: 5: Hoare triple {1032#(<= ~counter~0 0)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {1032#(<= ~counter~0 0)} is VALID [2022-04-27 14:18:46,633 INFO L272 TraceCheckUtils]: 6: Hoare triple {1032#(<= ~counter~0 0)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {1032#(<= ~counter~0 0)} is VALID [2022-04-27 14:18:46,633 INFO L290 TraceCheckUtils]: 7: Hoare triple {1032#(<= ~counter~0 0)} ~cond := #in~cond; {1032#(<= ~counter~0 0)} is VALID [2022-04-27 14:18:46,633 INFO L290 TraceCheckUtils]: 8: Hoare triple {1032#(<= ~counter~0 0)} assume !(0 == ~cond); {1032#(<= ~counter~0 0)} is VALID [2022-04-27 14:18:46,634 INFO L290 TraceCheckUtils]: 9: Hoare triple {1032#(<= ~counter~0 0)} assume true; {1032#(<= ~counter~0 0)} is VALID [2022-04-27 14:18:46,634 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1032#(<= ~counter~0 0)} {1032#(<= ~counter~0 0)} #59#return; {1032#(<= ~counter~0 0)} is VALID [2022-04-27 14:18:46,635 INFO L272 TraceCheckUtils]: 11: Hoare triple {1032#(<= ~counter~0 0)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {1032#(<= ~counter~0 0)} is VALID [2022-04-27 14:18:46,635 INFO L290 TraceCheckUtils]: 12: Hoare triple {1032#(<= ~counter~0 0)} ~cond := #in~cond; {1032#(<= ~counter~0 0)} is VALID [2022-04-27 14:18:46,635 INFO L290 TraceCheckUtils]: 13: Hoare triple {1032#(<= ~counter~0 0)} assume !(0 == ~cond); {1032#(<= ~counter~0 0)} is VALID [2022-04-27 14:18:46,636 INFO L290 TraceCheckUtils]: 14: Hoare triple {1032#(<= ~counter~0 0)} assume true; {1032#(<= ~counter~0 0)} is VALID [2022-04-27 14:18:46,636 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1032#(<= ~counter~0 0)} {1032#(<= ~counter~0 0)} #61#return; {1032#(<= ~counter~0 0)} is VALID [2022-04-27 14:18:46,636 INFO L290 TraceCheckUtils]: 16: Hoare triple {1032#(<= ~counter~0 0)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {1032#(<= ~counter~0 0)} is VALID [2022-04-27 14:18:46,637 INFO L290 TraceCheckUtils]: 17: Hoare triple {1032#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1081#(<= ~counter~0 1)} is VALID [2022-04-27 14:18:46,637 INFO L290 TraceCheckUtils]: 18: Hoare triple {1081#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {1081#(<= ~counter~0 1)} is VALID [2022-04-27 14:18:46,638 INFO L272 TraceCheckUtils]: 19: Hoare triple {1081#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {1081#(<= ~counter~0 1)} is VALID [2022-04-27 14:18:46,638 INFO L290 TraceCheckUtils]: 20: Hoare triple {1081#(<= ~counter~0 1)} ~cond := #in~cond; {1081#(<= ~counter~0 1)} is VALID [2022-04-27 14:18:46,639 INFO L290 TraceCheckUtils]: 21: Hoare triple {1081#(<= ~counter~0 1)} assume !(0 == ~cond); {1081#(<= ~counter~0 1)} is VALID [2022-04-27 14:18:46,639 INFO L290 TraceCheckUtils]: 22: Hoare triple {1081#(<= ~counter~0 1)} assume true; {1081#(<= ~counter~0 1)} is VALID [2022-04-27 14:18:46,640 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1081#(<= ~counter~0 1)} {1081#(<= ~counter~0 1)} #63#return; {1081#(<= ~counter~0 1)} is VALID [2022-04-27 14:18:46,640 INFO L290 TraceCheckUtils]: 24: Hoare triple {1081#(<= ~counter~0 1)} assume !!(0 != ~y3~0); {1081#(<= ~counter~0 1)} is VALID [2022-04-27 14:18:46,640 INFO L290 TraceCheckUtils]: 25: Hoare triple {1081#(<= ~counter~0 1)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {1081#(<= ~counter~0 1)} is VALID [2022-04-27 14:18:46,641 INFO L290 TraceCheckUtils]: 26: Hoare triple {1081#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1109#(<= |main_#t~post6| 1)} is VALID [2022-04-27 14:18:46,641 INFO L290 TraceCheckUtils]: 27: Hoare triple {1109#(<= |main_#t~post6| 1)} assume !(#t~post6 < 10);havoc #t~post6; {1025#false} is VALID [2022-04-27 14:18:46,641 INFO L272 TraceCheckUtils]: 28: Hoare triple {1025#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {1025#false} is VALID [2022-04-27 14:18:46,642 INFO L290 TraceCheckUtils]: 29: Hoare triple {1025#false} ~cond := #in~cond; {1025#false} is VALID [2022-04-27 14:18:46,642 INFO L290 TraceCheckUtils]: 30: Hoare triple {1025#false} assume 0 == ~cond; {1025#false} is VALID [2022-04-27 14:18:46,642 INFO L290 TraceCheckUtils]: 31: Hoare triple {1025#false} assume !false; {1025#false} is VALID [2022-04-27 14:18:46,642 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 14:18:46,642 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:18:46,806 INFO L290 TraceCheckUtils]: 31: Hoare triple {1025#false} assume !false; {1025#false} is VALID [2022-04-27 14:18:46,814 INFO L290 TraceCheckUtils]: 30: Hoare triple {1025#false} assume 0 == ~cond; {1025#false} is VALID [2022-04-27 14:18:46,815 INFO L290 TraceCheckUtils]: 29: Hoare triple {1025#false} ~cond := #in~cond; {1025#false} is VALID [2022-04-27 14:18:46,815 INFO L272 TraceCheckUtils]: 28: Hoare triple {1025#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {1025#false} is VALID [2022-04-27 14:18:46,815 INFO L290 TraceCheckUtils]: 27: Hoare triple {1137#(< |main_#t~post6| 10)} assume !(#t~post6 < 10);havoc #t~post6; {1025#false} is VALID [2022-04-27 14:18:46,816 INFO L290 TraceCheckUtils]: 26: Hoare triple {1141#(< ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1137#(< |main_#t~post6| 10)} is VALID [2022-04-27 14:18:46,816 INFO L290 TraceCheckUtils]: 25: Hoare triple {1141#(< ~counter~0 10)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {1141#(< ~counter~0 10)} is VALID [2022-04-27 14:18:46,816 INFO L290 TraceCheckUtils]: 24: Hoare triple {1141#(< ~counter~0 10)} assume !!(0 != ~y3~0); {1141#(< ~counter~0 10)} is VALID [2022-04-27 14:18:46,817 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1024#true} {1141#(< ~counter~0 10)} #63#return; {1141#(< ~counter~0 10)} is VALID [2022-04-27 14:18:46,818 INFO L290 TraceCheckUtils]: 22: Hoare triple {1024#true} assume true; {1024#true} is VALID [2022-04-27 14:18:46,818 INFO L290 TraceCheckUtils]: 21: Hoare triple {1024#true} assume !(0 == ~cond); {1024#true} is VALID [2022-04-27 14:18:46,818 INFO L290 TraceCheckUtils]: 20: Hoare triple {1024#true} ~cond := #in~cond; {1024#true} is VALID [2022-04-27 14:18:46,819 INFO L272 TraceCheckUtils]: 19: Hoare triple {1141#(< ~counter~0 10)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {1024#true} is VALID [2022-04-27 14:18:46,819 INFO L290 TraceCheckUtils]: 18: Hoare triple {1141#(< ~counter~0 10)} assume !!(#t~post6 < 10);havoc #t~post6; {1141#(< ~counter~0 10)} is VALID [2022-04-27 14:18:46,819 INFO L290 TraceCheckUtils]: 17: Hoare triple {1169#(< ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1141#(< ~counter~0 10)} is VALID [2022-04-27 14:18:46,822 INFO L290 TraceCheckUtils]: 16: Hoare triple {1169#(< ~counter~0 9)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {1169#(< ~counter~0 9)} is VALID [2022-04-27 14:18:46,823 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1024#true} {1169#(< ~counter~0 9)} #61#return; {1169#(< ~counter~0 9)} is VALID [2022-04-27 14:18:46,823 INFO L290 TraceCheckUtils]: 14: Hoare triple {1024#true} assume true; {1024#true} is VALID [2022-04-27 14:18:46,823 INFO L290 TraceCheckUtils]: 13: Hoare triple {1024#true} assume !(0 == ~cond); {1024#true} is VALID [2022-04-27 14:18:46,823 INFO L290 TraceCheckUtils]: 12: Hoare triple {1024#true} ~cond := #in~cond; {1024#true} is VALID [2022-04-27 14:18:46,823 INFO L272 TraceCheckUtils]: 11: Hoare triple {1169#(< ~counter~0 9)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {1024#true} is VALID [2022-04-27 14:18:46,824 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1024#true} {1169#(< ~counter~0 9)} #59#return; {1169#(< ~counter~0 9)} is VALID [2022-04-27 14:18:46,824 INFO L290 TraceCheckUtils]: 9: Hoare triple {1024#true} assume true; {1024#true} is VALID [2022-04-27 14:18:46,824 INFO L290 TraceCheckUtils]: 8: Hoare triple {1024#true} assume !(0 == ~cond); {1024#true} is VALID [2022-04-27 14:18:46,824 INFO L290 TraceCheckUtils]: 7: Hoare triple {1024#true} ~cond := #in~cond; {1024#true} is VALID [2022-04-27 14:18:46,824 INFO L272 TraceCheckUtils]: 6: Hoare triple {1169#(< ~counter~0 9)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {1024#true} is VALID [2022-04-27 14:18:46,825 INFO L290 TraceCheckUtils]: 5: Hoare triple {1169#(< ~counter~0 9)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {1169#(< ~counter~0 9)} is VALID [2022-04-27 14:18:46,825 INFO L272 TraceCheckUtils]: 4: Hoare triple {1169#(< ~counter~0 9)} call #t~ret7 := main(); {1169#(< ~counter~0 9)} is VALID [2022-04-27 14:18:46,828 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1169#(< ~counter~0 9)} {1024#true} #67#return; {1169#(< ~counter~0 9)} is VALID [2022-04-27 14:18:46,829 INFO L290 TraceCheckUtils]: 2: Hoare triple {1169#(< ~counter~0 9)} assume true; {1169#(< ~counter~0 9)} is VALID [2022-04-27 14:18:46,829 INFO L290 TraceCheckUtils]: 1: Hoare triple {1024#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1169#(< ~counter~0 9)} is VALID [2022-04-27 14:18:46,829 INFO L272 TraceCheckUtils]: 0: Hoare triple {1024#true} call ULTIMATE.init(); {1024#true} is VALID [2022-04-27 14:18:46,830 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 14:18:46,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:18:46,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327600819] [2022-04-27 14:18:46,830 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:18:46,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1322492200] [2022-04-27 14:18:46,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1322492200] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 14:18:46,830 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 14:18:46,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-27 14:18:46,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586732176] [2022-04-27 14:18:46,831 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 14:18:46,831 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) Word has length 32 [2022-04-27 14:18:46,832 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:18:46,832 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2022-04-27 14:18:46,869 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:18:46,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 14:18:46,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:18:46,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 14:18:46,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-27 14:18:46,871 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2022-04-27 14:18:47,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:18:47,046 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2022-04-27 14:18:47,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 14:18:47,047 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) Word has length 32 [2022-04-27 14:18:47,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:18:47,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2022-04-27 14:18:47,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 67 transitions. [2022-04-27 14:18:47,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2022-04-27 14:18:47,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 67 transitions. [2022-04-27 14:18:47,051 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 67 transitions. [2022-04-27 14:18:47,103 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:18:47,104 INFO L225 Difference]: With dead ends: 61 [2022-04-27 14:18:47,104 INFO L226 Difference]: Without dead ends: 56 [2022-04-27 14:18:47,105 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-27 14:18:47,105 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 43 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:18:47,106 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 116 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:18:47,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-27 14:18:47,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-04-27 14:18:47,120 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:18:47,120 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:18:47,121 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:18:47,121 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:18:47,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:18:47,123 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2022-04-27 14:18:47,123 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-04-27 14:18:47,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:18:47,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:18:47,124 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 56 states. [2022-04-27 14:18:47,124 INFO L87 Difference]: Start difference. First operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 56 states. [2022-04-27 14:18:47,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:18:47,126 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2022-04-27 14:18:47,126 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-04-27 14:18:47,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:18:47,127 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:18:47,127 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:18:47,127 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:18:47,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:18:47,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2022-04-27 14:18:47,129 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 32 [2022-04-27 14:18:47,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:18:47,130 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2022-04-27 14:18:47,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2022-04-27 14:18:47,130 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-04-27 14:18:47,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-27 14:18:47,131 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:18:47,131 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:18:47,153 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-27 14:18:47,353 WARN L477 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-27 14:18:47,353 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:18:47,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:18:47,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1632159894, now seen corresponding path program 2 times [2022-04-27 14:18:47,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:18:47,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253187276] [2022-04-27 14:18:47,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:18:47,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:18:47,380 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:18:47,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [159861839] [2022-04-27 14:18:47,380 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 14:18:47,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:18:47,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:18:47,383 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:18:47,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-27 14:18:47,433 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 14:18:47,434 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:18:47,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-27 14:18:47,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:18:47,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:18:47,788 INFO L272 TraceCheckUtils]: 0: Hoare triple {1504#true} call ULTIMATE.init(); {1504#true} is VALID [2022-04-27 14:18:47,789 INFO L290 TraceCheckUtils]: 1: Hoare triple {1504#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1512#(<= ~counter~0 0)} is VALID [2022-04-27 14:18:47,790 INFO L290 TraceCheckUtils]: 2: Hoare triple {1512#(<= ~counter~0 0)} assume true; {1512#(<= ~counter~0 0)} is VALID [2022-04-27 14:18:47,790 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1512#(<= ~counter~0 0)} {1504#true} #67#return; {1512#(<= ~counter~0 0)} is VALID [2022-04-27 14:18:47,791 INFO L272 TraceCheckUtils]: 4: Hoare triple {1512#(<= ~counter~0 0)} call #t~ret7 := main(); {1512#(<= ~counter~0 0)} is VALID [2022-04-27 14:18:47,791 INFO L290 TraceCheckUtils]: 5: Hoare triple {1512#(<= ~counter~0 0)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {1512#(<= ~counter~0 0)} is VALID [2022-04-27 14:18:47,792 INFO L272 TraceCheckUtils]: 6: Hoare triple {1512#(<= ~counter~0 0)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {1512#(<= ~counter~0 0)} is VALID [2022-04-27 14:18:47,792 INFO L290 TraceCheckUtils]: 7: Hoare triple {1512#(<= ~counter~0 0)} ~cond := #in~cond; {1512#(<= ~counter~0 0)} is VALID [2022-04-27 14:18:47,793 INFO L290 TraceCheckUtils]: 8: Hoare triple {1512#(<= ~counter~0 0)} assume !(0 == ~cond); {1512#(<= ~counter~0 0)} is VALID [2022-04-27 14:18:47,793 INFO L290 TraceCheckUtils]: 9: Hoare triple {1512#(<= ~counter~0 0)} assume true; {1512#(<= ~counter~0 0)} is VALID [2022-04-27 14:18:47,794 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1512#(<= ~counter~0 0)} {1512#(<= ~counter~0 0)} #59#return; {1512#(<= ~counter~0 0)} is VALID [2022-04-27 14:18:47,794 INFO L272 TraceCheckUtils]: 11: Hoare triple {1512#(<= ~counter~0 0)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {1512#(<= ~counter~0 0)} is VALID [2022-04-27 14:18:47,795 INFO L290 TraceCheckUtils]: 12: Hoare triple {1512#(<= ~counter~0 0)} ~cond := #in~cond; {1512#(<= ~counter~0 0)} is VALID [2022-04-27 14:18:47,795 INFO L290 TraceCheckUtils]: 13: Hoare triple {1512#(<= ~counter~0 0)} assume !(0 == ~cond); {1512#(<= ~counter~0 0)} is VALID [2022-04-27 14:18:47,795 INFO L290 TraceCheckUtils]: 14: Hoare triple {1512#(<= ~counter~0 0)} assume true; {1512#(<= ~counter~0 0)} is VALID [2022-04-27 14:18:47,796 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1512#(<= ~counter~0 0)} {1512#(<= ~counter~0 0)} #61#return; {1512#(<= ~counter~0 0)} is VALID [2022-04-27 14:18:47,796 INFO L290 TraceCheckUtils]: 16: Hoare triple {1512#(<= ~counter~0 0)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {1512#(<= ~counter~0 0)} is VALID [2022-04-27 14:18:47,797 INFO L290 TraceCheckUtils]: 17: Hoare triple {1512#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1561#(<= ~counter~0 1)} is VALID [2022-04-27 14:18:47,797 INFO L290 TraceCheckUtils]: 18: Hoare triple {1561#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {1561#(<= ~counter~0 1)} is VALID [2022-04-27 14:18:47,798 INFO L272 TraceCheckUtils]: 19: Hoare triple {1561#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {1561#(<= ~counter~0 1)} is VALID [2022-04-27 14:18:47,798 INFO L290 TraceCheckUtils]: 20: Hoare triple {1561#(<= ~counter~0 1)} ~cond := #in~cond; {1561#(<= ~counter~0 1)} is VALID [2022-04-27 14:18:47,799 INFO L290 TraceCheckUtils]: 21: Hoare triple {1561#(<= ~counter~0 1)} assume !(0 == ~cond); {1561#(<= ~counter~0 1)} is VALID [2022-04-27 14:18:47,799 INFO L290 TraceCheckUtils]: 22: Hoare triple {1561#(<= ~counter~0 1)} assume true; {1561#(<= ~counter~0 1)} is VALID [2022-04-27 14:18:47,800 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1561#(<= ~counter~0 1)} {1561#(<= ~counter~0 1)} #63#return; {1561#(<= ~counter~0 1)} is VALID [2022-04-27 14:18:47,800 INFO L290 TraceCheckUtils]: 24: Hoare triple {1561#(<= ~counter~0 1)} assume !!(0 != ~y3~0); {1561#(<= ~counter~0 1)} is VALID [2022-04-27 14:18:47,800 INFO L290 TraceCheckUtils]: 25: Hoare triple {1561#(<= ~counter~0 1)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {1561#(<= ~counter~0 1)} is VALID [2022-04-27 14:18:47,801 INFO L290 TraceCheckUtils]: 26: Hoare triple {1561#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1589#(<= ~counter~0 2)} is VALID [2022-04-27 14:18:47,801 INFO L290 TraceCheckUtils]: 27: Hoare triple {1589#(<= ~counter~0 2)} assume !!(#t~post6 < 10);havoc #t~post6; {1589#(<= ~counter~0 2)} is VALID [2022-04-27 14:18:47,802 INFO L272 TraceCheckUtils]: 28: Hoare triple {1589#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {1589#(<= ~counter~0 2)} is VALID [2022-04-27 14:18:47,802 INFO L290 TraceCheckUtils]: 29: Hoare triple {1589#(<= ~counter~0 2)} ~cond := #in~cond; {1589#(<= ~counter~0 2)} is VALID [2022-04-27 14:18:47,803 INFO L290 TraceCheckUtils]: 30: Hoare triple {1589#(<= ~counter~0 2)} assume !(0 == ~cond); {1589#(<= ~counter~0 2)} is VALID [2022-04-27 14:18:47,803 INFO L290 TraceCheckUtils]: 31: Hoare triple {1589#(<= ~counter~0 2)} assume true; {1589#(<= ~counter~0 2)} is VALID [2022-04-27 14:18:47,804 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1589#(<= ~counter~0 2)} {1589#(<= ~counter~0 2)} #63#return; {1589#(<= ~counter~0 2)} is VALID [2022-04-27 14:18:47,804 INFO L290 TraceCheckUtils]: 33: Hoare triple {1589#(<= ~counter~0 2)} assume !!(0 != ~y3~0); {1589#(<= ~counter~0 2)} is VALID [2022-04-27 14:18:47,805 INFO L290 TraceCheckUtils]: 34: Hoare triple {1589#(<= ~counter~0 2)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {1589#(<= ~counter~0 2)} is VALID [2022-04-27 14:18:47,805 INFO L290 TraceCheckUtils]: 35: Hoare triple {1589#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1617#(<= ~counter~0 3)} is VALID [2022-04-27 14:18:47,806 INFO L290 TraceCheckUtils]: 36: Hoare triple {1617#(<= ~counter~0 3)} assume !!(#t~post6 < 10);havoc #t~post6; {1617#(<= ~counter~0 3)} is VALID [2022-04-27 14:18:47,806 INFO L272 TraceCheckUtils]: 37: Hoare triple {1617#(<= ~counter~0 3)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {1617#(<= ~counter~0 3)} is VALID [2022-04-27 14:18:47,807 INFO L290 TraceCheckUtils]: 38: Hoare triple {1617#(<= ~counter~0 3)} ~cond := #in~cond; {1617#(<= ~counter~0 3)} is VALID [2022-04-27 14:18:47,807 INFO L290 TraceCheckUtils]: 39: Hoare triple {1617#(<= ~counter~0 3)} assume !(0 == ~cond); {1617#(<= ~counter~0 3)} is VALID [2022-04-27 14:18:47,807 INFO L290 TraceCheckUtils]: 40: Hoare triple {1617#(<= ~counter~0 3)} assume true; {1617#(<= ~counter~0 3)} is VALID [2022-04-27 14:18:47,808 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {1617#(<= ~counter~0 3)} {1617#(<= ~counter~0 3)} #63#return; {1617#(<= ~counter~0 3)} is VALID [2022-04-27 14:18:47,809 INFO L290 TraceCheckUtils]: 42: Hoare triple {1617#(<= ~counter~0 3)} assume !!(0 != ~y3~0); {1617#(<= ~counter~0 3)} is VALID [2022-04-27 14:18:47,809 INFO L290 TraceCheckUtils]: 43: Hoare triple {1617#(<= ~counter~0 3)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {1617#(<= ~counter~0 3)} is VALID [2022-04-27 14:18:47,809 INFO L290 TraceCheckUtils]: 44: Hoare triple {1617#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1645#(<= ~counter~0 4)} is VALID [2022-04-27 14:18:47,810 INFO L290 TraceCheckUtils]: 45: Hoare triple {1645#(<= ~counter~0 4)} assume !!(#t~post6 < 10);havoc #t~post6; {1645#(<= ~counter~0 4)} is VALID [2022-04-27 14:18:47,811 INFO L272 TraceCheckUtils]: 46: Hoare triple {1645#(<= ~counter~0 4)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {1645#(<= ~counter~0 4)} is VALID [2022-04-27 14:18:47,811 INFO L290 TraceCheckUtils]: 47: Hoare triple {1645#(<= ~counter~0 4)} ~cond := #in~cond; {1645#(<= ~counter~0 4)} is VALID [2022-04-27 14:18:47,811 INFO L290 TraceCheckUtils]: 48: Hoare triple {1645#(<= ~counter~0 4)} assume !(0 == ~cond); {1645#(<= ~counter~0 4)} is VALID [2022-04-27 14:18:47,812 INFO L290 TraceCheckUtils]: 49: Hoare triple {1645#(<= ~counter~0 4)} assume true; {1645#(<= ~counter~0 4)} is VALID [2022-04-27 14:18:47,812 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {1645#(<= ~counter~0 4)} {1645#(<= ~counter~0 4)} #63#return; {1645#(<= ~counter~0 4)} is VALID [2022-04-27 14:18:47,813 INFO L290 TraceCheckUtils]: 51: Hoare triple {1645#(<= ~counter~0 4)} assume !!(0 != ~y3~0); {1645#(<= ~counter~0 4)} is VALID [2022-04-27 14:18:47,813 INFO L290 TraceCheckUtils]: 52: Hoare triple {1645#(<= ~counter~0 4)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {1645#(<= ~counter~0 4)} is VALID [2022-04-27 14:18:47,813 INFO L290 TraceCheckUtils]: 53: Hoare triple {1645#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1673#(<= |main_#t~post6| 4)} is VALID [2022-04-27 14:18:47,814 INFO L290 TraceCheckUtils]: 54: Hoare triple {1673#(<= |main_#t~post6| 4)} assume !(#t~post6 < 10);havoc #t~post6; {1505#false} is VALID [2022-04-27 14:18:47,814 INFO L272 TraceCheckUtils]: 55: Hoare triple {1505#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {1505#false} is VALID [2022-04-27 14:18:47,814 INFO L290 TraceCheckUtils]: 56: Hoare triple {1505#false} ~cond := #in~cond; {1505#false} is VALID [2022-04-27 14:18:47,814 INFO L290 TraceCheckUtils]: 57: Hoare triple {1505#false} assume 0 == ~cond; {1505#false} is VALID [2022-04-27 14:18:47,814 INFO L290 TraceCheckUtils]: 58: Hoare triple {1505#false} assume !false; {1505#false} is VALID [2022-04-27 14:18:47,815 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 62 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 14:18:47,815 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:18:48,173 INFO L290 TraceCheckUtils]: 58: Hoare triple {1505#false} assume !false; {1505#false} is VALID [2022-04-27 14:18:48,173 INFO L290 TraceCheckUtils]: 57: Hoare triple {1505#false} assume 0 == ~cond; {1505#false} is VALID [2022-04-27 14:18:48,173 INFO L290 TraceCheckUtils]: 56: Hoare triple {1505#false} ~cond := #in~cond; {1505#false} is VALID [2022-04-27 14:18:48,174 INFO L272 TraceCheckUtils]: 55: Hoare triple {1505#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {1505#false} is VALID [2022-04-27 14:18:48,174 INFO L290 TraceCheckUtils]: 54: Hoare triple {1701#(< |main_#t~post6| 10)} assume !(#t~post6 < 10);havoc #t~post6; {1505#false} is VALID [2022-04-27 14:18:48,174 INFO L290 TraceCheckUtils]: 53: Hoare triple {1705#(< ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1701#(< |main_#t~post6| 10)} is VALID [2022-04-27 14:18:48,175 INFO L290 TraceCheckUtils]: 52: Hoare triple {1705#(< ~counter~0 10)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {1705#(< ~counter~0 10)} is VALID [2022-04-27 14:18:48,175 INFO L290 TraceCheckUtils]: 51: Hoare triple {1705#(< ~counter~0 10)} assume !!(0 != ~y3~0); {1705#(< ~counter~0 10)} is VALID [2022-04-27 14:18:48,176 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {1504#true} {1705#(< ~counter~0 10)} #63#return; {1705#(< ~counter~0 10)} is VALID [2022-04-27 14:18:48,176 INFO L290 TraceCheckUtils]: 49: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-27 14:18:48,176 INFO L290 TraceCheckUtils]: 48: Hoare triple {1504#true} assume !(0 == ~cond); {1504#true} is VALID [2022-04-27 14:18:48,176 INFO L290 TraceCheckUtils]: 47: Hoare triple {1504#true} ~cond := #in~cond; {1504#true} is VALID [2022-04-27 14:18:48,176 INFO L272 TraceCheckUtils]: 46: Hoare triple {1705#(< ~counter~0 10)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {1504#true} is VALID [2022-04-27 14:18:48,176 INFO L290 TraceCheckUtils]: 45: Hoare triple {1705#(< ~counter~0 10)} assume !!(#t~post6 < 10);havoc #t~post6; {1705#(< ~counter~0 10)} is VALID [2022-04-27 14:18:48,177 INFO L290 TraceCheckUtils]: 44: Hoare triple {1733#(< ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1705#(< ~counter~0 10)} is VALID [2022-04-27 14:18:48,177 INFO L290 TraceCheckUtils]: 43: Hoare triple {1733#(< ~counter~0 9)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {1733#(< ~counter~0 9)} is VALID [2022-04-27 14:18:48,177 INFO L290 TraceCheckUtils]: 42: Hoare triple {1733#(< ~counter~0 9)} assume !!(0 != ~y3~0); {1733#(< ~counter~0 9)} is VALID [2022-04-27 14:18:48,178 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {1504#true} {1733#(< ~counter~0 9)} #63#return; {1733#(< ~counter~0 9)} is VALID [2022-04-27 14:18:48,178 INFO L290 TraceCheckUtils]: 40: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-27 14:18:48,178 INFO L290 TraceCheckUtils]: 39: Hoare triple {1504#true} assume !(0 == ~cond); {1504#true} is VALID [2022-04-27 14:18:48,178 INFO L290 TraceCheckUtils]: 38: Hoare triple {1504#true} ~cond := #in~cond; {1504#true} is VALID [2022-04-27 14:18:48,178 INFO L272 TraceCheckUtils]: 37: Hoare triple {1733#(< ~counter~0 9)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {1504#true} is VALID [2022-04-27 14:18:48,179 INFO L290 TraceCheckUtils]: 36: Hoare triple {1733#(< ~counter~0 9)} assume !!(#t~post6 < 10);havoc #t~post6; {1733#(< ~counter~0 9)} is VALID [2022-04-27 14:18:48,180 INFO L290 TraceCheckUtils]: 35: Hoare triple {1761#(< ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1733#(< ~counter~0 9)} is VALID [2022-04-27 14:18:48,180 INFO L290 TraceCheckUtils]: 34: Hoare triple {1761#(< ~counter~0 8)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {1761#(< ~counter~0 8)} is VALID [2022-04-27 14:18:48,180 INFO L290 TraceCheckUtils]: 33: Hoare triple {1761#(< ~counter~0 8)} assume !!(0 != ~y3~0); {1761#(< ~counter~0 8)} is VALID [2022-04-27 14:18:48,181 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1504#true} {1761#(< ~counter~0 8)} #63#return; {1761#(< ~counter~0 8)} is VALID [2022-04-27 14:18:48,181 INFO L290 TraceCheckUtils]: 31: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-27 14:18:48,181 INFO L290 TraceCheckUtils]: 30: Hoare triple {1504#true} assume !(0 == ~cond); {1504#true} is VALID [2022-04-27 14:18:48,181 INFO L290 TraceCheckUtils]: 29: Hoare triple {1504#true} ~cond := #in~cond; {1504#true} is VALID [2022-04-27 14:18:48,182 INFO L272 TraceCheckUtils]: 28: Hoare triple {1761#(< ~counter~0 8)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {1504#true} is VALID [2022-04-27 14:18:48,182 INFO L290 TraceCheckUtils]: 27: Hoare triple {1761#(< ~counter~0 8)} assume !!(#t~post6 < 10);havoc #t~post6; {1761#(< ~counter~0 8)} is VALID [2022-04-27 14:18:48,182 INFO L290 TraceCheckUtils]: 26: Hoare triple {1789#(< ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1761#(< ~counter~0 8)} is VALID [2022-04-27 14:18:48,183 INFO L290 TraceCheckUtils]: 25: Hoare triple {1789#(< ~counter~0 7)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {1789#(< ~counter~0 7)} is VALID [2022-04-27 14:18:48,183 INFO L290 TraceCheckUtils]: 24: Hoare triple {1789#(< ~counter~0 7)} assume !!(0 != ~y3~0); {1789#(< ~counter~0 7)} is VALID [2022-04-27 14:18:48,184 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1504#true} {1789#(< ~counter~0 7)} #63#return; {1789#(< ~counter~0 7)} is VALID [2022-04-27 14:18:48,184 INFO L290 TraceCheckUtils]: 22: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-27 14:18:48,184 INFO L290 TraceCheckUtils]: 21: Hoare triple {1504#true} assume !(0 == ~cond); {1504#true} is VALID [2022-04-27 14:18:48,184 INFO L290 TraceCheckUtils]: 20: Hoare triple {1504#true} ~cond := #in~cond; {1504#true} is VALID [2022-04-27 14:18:48,184 INFO L272 TraceCheckUtils]: 19: Hoare triple {1789#(< ~counter~0 7)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {1504#true} is VALID [2022-04-27 14:18:48,185 INFO L290 TraceCheckUtils]: 18: Hoare triple {1789#(< ~counter~0 7)} assume !!(#t~post6 < 10);havoc #t~post6; {1789#(< ~counter~0 7)} is VALID [2022-04-27 14:18:48,186 INFO L290 TraceCheckUtils]: 17: Hoare triple {1817#(< ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1789#(< ~counter~0 7)} is VALID [2022-04-27 14:18:48,186 INFO L290 TraceCheckUtils]: 16: Hoare triple {1817#(< ~counter~0 6)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {1817#(< ~counter~0 6)} is VALID [2022-04-27 14:18:48,186 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1504#true} {1817#(< ~counter~0 6)} #61#return; {1817#(< ~counter~0 6)} is VALID [2022-04-27 14:18:48,187 INFO L290 TraceCheckUtils]: 14: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-27 14:18:48,187 INFO L290 TraceCheckUtils]: 13: Hoare triple {1504#true} assume !(0 == ~cond); {1504#true} is VALID [2022-04-27 14:18:48,187 INFO L290 TraceCheckUtils]: 12: Hoare triple {1504#true} ~cond := #in~cond; {1504#true} is VALID [2022-04-27 14:18:48,187 INFO L272 TraceCheckUtils]: 11: Hoare triple {1817#(< ~counter~0 6)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {1504#true} is VALID [2022-04-27 14:18:48,188 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1504#true} {1817#(< ~counter~0 6)} #59#return; {1817#(< ~counter~0 6)} is VALID [2022-04-27 14:18:48,188 INFO L290 TraceCheckUtils]: 9: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-27 14:18:48,188 INFO L290 TraceCheckUtils]: 8: Hoare triple {1504#true} assume !(0 == ~cond); {1504#true} is VALID [2022-04-27 14:18:48,188 INFO L290 TraceCheckUtils]: 7: Hoare triple {1504#true} ~cond := #in~cond; {1504#true} is VALID [2022-04-27 14:18:48,188 INFO L272 TraceCheckUtils]: 6: Hoare triple {1817#(< ~counter~0 6)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {1504#true} is VALID [2022-04-27 14:18:48,188 INFO L290 TraceCheckUtils]: 5: Hoare triple {1817#(< ~counter~0 6)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {1817#(< ~counter~0 6)} is VALID [2022-04-27 14:18:48,189 INFO L272 TraceCheckUtils]: 4: Hoare triple {1817#(< ~counter~0 6)} call #t~ret7 := main(); {1817#(< ~counter~0 6)} is VALID [2022-04-27 14:18:48,189 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1817#(< ~counter~0 6)} {1504#true} #67#return; {1817#(< ~counter~0 6)} is VALID [2022-04-27 14:18:48,189 INFO L290 TraceCheckUtils]: 2: Hoare triple {1817#(< ~counter~0 6)} assume true; {1817#(< ~counter~0 6)} is VALID [2022-04-27 14:18:48,190 INFO L290 TraceCheckUtils]: 1: Hoare triple {1504#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1817#(< ~counter~0 6)} is VALID [2022-04-27 14:18:48,190 INFO L272 TraceCheckUtils]: 0: Hoare triple {1504#true} call ULTIMATE.init(); {1504#true} is VALID [2022-04-27 14:18:48,190 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 38 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-27 14:18:48,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:18:48,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253187276] [2022-04-27 14:18:48,191 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:18:48,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [159861839] [2022-04-27 14:18:48,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [159861839] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 14:18:48,191 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 14:18:48,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-27 14:18:48,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446966877] [2022-04-27 14:18:48,191 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 14:18:48,192 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) Word has length 59 [2022-04-27 14:18:48,192 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:18:48,193 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) [2022-04-27 14:18:48,288 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:18:48,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 14:18:48,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:18:48,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 14:18:48,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-27 14:18:48,289 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) [2022-04-27 14:18:48,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:18:48,763 INFO L93 Difference]: Finished difference Result 115 states and 131 transitions. [2022-04-27 14:18:48,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-27 14:18:48,764 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) Word has length 59 [2022-04-27 14:18:48,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:18:48,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) [2022-04-27 14:18:48,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 130 transitions. [2022-04-27 14:18:48,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) [2022-04-27 14:18:48,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 130 transitions. [2022-04-27 14:18:48,773 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 130 transitions. [2022-04-27 14:18:48,876 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:18:48,878 INFO L225 Difference]: With dead ends: 115 [2022-04-27 14:18:48,879 INFO L226 Difference]: Without dead ends: 110 [2022-04-27 14:18:48,879 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2022-04-27 14:18:48,880 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 158 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:18:48,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 176 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 14:18:48,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-04-27 14:18:48,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2022-04-27 14:18:48,922 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:18:48,922 INFO L82 GeneralOperation]: Start isEquivalent. First operand 110 states. Second operand has 110 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 82 states have internal predecessors, (93), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 14:18:48,923 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand has 110 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 82 states have internal predecessors, (93), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 14:18:48,923 INFO L87 Difference]: Start difference. First operand 110 states. Second operand has 110 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 82 states have internal predecessors, (93), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 14:18:48,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:18:48,927 INFO L93 Difference]: Finished difference Result 110 states and 121 transitions. [2022-04-27 14:18:48,927 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2022-04-27 14:18:48,927 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:18:48,927 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:18:48,928 INFO L74 IsIncluded]: Start isIncluded. First operand has 110 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 82 states have internal predecessors, (93), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 110 states. [2022-04-27 14:18:48,928 INFO L87 Difference]: Start difference. First operand has 110 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 82 states have internal predecessors, (93), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 110 states. [2022-04-27 14:18:48,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:18:48,931 INFO L93 Difference]: Finished difference Result 110 states and 121 transitions. [2022-04-27 14:18:48,931 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2022-04-27 14:18:48,932 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:18:48,932 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:18:48,932 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:18:48,932 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:18:48,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 82 states have internal predecessors, (93), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 14:18:48,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2022-04-27 14:18:48,936 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 59 [2022-04-27 14:18:48,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:18:48,936 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2022-04-27 14:18:48,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) [2022-04-27 14:18:48,936 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2022-04-27 14:18:48,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-04-27 14:18:48,938 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:18:48,938 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:18:48,961 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-27 14:18:49,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:18:49,151 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:18:49,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:18:49,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1468805930, now seen corresponding path program 3 times [2022-04-27 14:18:49,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:18:49,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106377190] [2022-04-27 14:18:49,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:18:49,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:18:49,183 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:18:49,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [79527386] [2022-04-27 14:18:49,184 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 14:18:49,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:18:49,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:18:49,187 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:18:49,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-27 14:18:49,273 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-04-27 14:18:49,273 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-04-27 14:18:49,273 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-27 14:18:49,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 14:18:49,354 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-27 14:18:49,354 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-27 14:18:49,355 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 14:18:49,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-27 14:18:49,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:18:49,581 INFO L356 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1] [2022-04-27 14:18:49,587 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 14:18:49,658 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 14:18:49,658 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-27 14:18:49,658 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-27 14:18:49,658 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-27 14:18:49,658 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-27 14:18:49,658 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-27 14:18:49,658 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-27 14:18:49,658 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 14:18:49,658 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 14:18:49,658 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-27 14:18:49,658 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-27 14:18:49,658 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-27 14:18:49,658 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-27 14:18:49,658 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-27 14:18:49,658 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-27 14:18:49,658 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 14:18:49,659 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 14:18:49,659 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 14:18:49,659 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 14:18:49,659 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2022-04-27 14:18:49,659 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2022-04-27 14:18:49,659 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2022-04-27 14:18:49,659 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2022-04-27 14:18:49,662 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2022-04-27 14:18:49,662 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2022-04-27 14:18:49,662 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 14:18:49,667 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 14:18:49,667 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2022-04-27 14:18:49,667 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 14:18:49,667 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 14:18:49,667 WARN L170 areAnnotationChecker]: L41-2 has no Hoare annotation [2022-04-27 14:18:49,667 WARN L170 areAnnotationChecker]: L41-2 has no Hoare annotation [2022-04-27 14:18:49,667 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2022-04-27 14:18:49,667 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2022-04-27 14:18:49,668 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-04-27 14:18:49,668 WARN L170 areAnnotationChecker]: L36-3 has no Hoare annotation [2022-04-27 14:18:49,668 WARN L170 areAnnotationChecker]: L36-3 has no Hoare annotation [2022-04-27 14:18:49,668 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2022-04-27 14:18:49,668 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2022-04-27 14:18:49,668 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-04-27 14:18:49,668 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-04-27 14:18:49,668 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 14:18:49,668 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-27 14:18:49,668 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-27 14:18:49,668 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 14:18:49,668 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 14:18:49,669 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 02:18:49 BoogieIcfgContainer [2022-04-27 14:18:49,669 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 14:18:49,670 INFO L158 Benchmark]: Toolchain (without parser) took 13657.18ms. Allocated memory was 201.3MB in the beginning and 250.6MB in the end (delta: 49.3MB). Free memory was 150.8MB in the beginning and 143.3MB in the end (delta: 7.6MB). Peak memory consumption was 57.9MB. Max. memory is 8.0GB. [2022-04-27 14:18:49,671 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 201.3MB. Free memory is still 167.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 14:18:49,671 INFO L158 Benchmark]: CACSL2BoogieTranslator took 204.73ms. Allocated memory is still 201.3MB. Free memory was 150.7MB in the beginning and 175.3MB in the end (delta: -24.6MB). Peak memory consumption was 12.4MB. Max. memory is 8.0GB. [2022-04-27 14:18:49,672 INFO L158 Benchmark]: Boogie Preprocessor took 26.00ms. Allocated memory is still 201.3MB. Free memory was 175.3MB in the beginning and 173.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 14:18:49,672 INFO L158 Benchmark]: RCFGBuilder took 311.33ms. Allocated memory is still 201.3MB. Free memory was 173.7MB in the beginning and 163.1MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-27 14:18:49,672 INFO L158 Benchmark]: TraceAbstraction took 13109.95ms. Allocated memory was 201.3MB in the beginning and 250.6MB in the end (delta: 49.3MB). Free memory was 162.3MB in the beginning and 143.3MB in the end (delta: 19.0MB). Peak memory consumption was 69.6MB. Max. memory is 8.0GB. [2022-04-27 14:18:49,675 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.29ms. Allocated memory is still 201.3MB. Free memory is still 167.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 204.73ms. Allocated memory is still 201.3MB. Free memory was 150.7MB in the beginning and 175.3MB in the end (delta: -24.6MB). Peak memory consumption was 12.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.00ms. Allocated memory is still 201.3MB. Free memory was 175.3MB in the beginning and 173.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 311.33ms. Allocated memory is still 201.3MB. Free memory was 173.7MB in the beginning and 163.1MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 13109.95ms. Allocated memory was 201.3MB in the beginning and 250.6MB in the end (delta: 49.3MB). Free memory was 162.3MB in the beginning and 143.3MB in the end (delta: 19.0MB). Peak memory consumption was 69.6MB. 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)=13, 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=11, 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=11, x2=1] [L32] y1 = 0 [L33] y2 = 0 [L34] y3 = x1 VAL [\old(counter)=0, counter=0, x1=11, x2=1, y1=0, y2=0, y3=11] [L36] EXPR counter++ VAL [\old(counter)=0, counter=1, counter++=0, x1=11, x2=1, y1=0, y2=0, y3=11] [L36] COND TRUE counter++<10 [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=11, x2=1, y1=0, y2=0, y3=11] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=1, x1=11, x2=1, y1=0, y2=0, y3=11] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=1, x1=11, x2=1, y1=1, y2=0, y3=10] [L36] EXPR counter++ VAL [\old(counter)=0, counter=2, counter++=1, x1=11, x2=1, y1=1, y2=0, y3=10] [L36] COND TRUE counter++<10 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=2, x1=11, x2=1, y1=1, y2=0, y3=10] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=2, x1=11, x2=1, y1=1, y2=0, y3=10] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=2, x1=11, x2=1, y1=2, y2=0, y3=9] [L36] EXPR counter++ VAL [\old(counter)=0, counter=3, counter++=2, x1=11, x2=1, y1=2, y2=0, y3=9] [L36] COND TRUE counter++<10 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=3, x1=11, x2=1, y1=2, y2=0, y3=9] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=3, x1=11, x2=1, y1=2, y2=0, y3=9] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=3, x1=11, x2=1, y1=3, y2=0, y3=8] [L36] EXPR counter++ VAL [\old(counter)=0, counter=4, counter++=3, x1=11, x2=1, y1=3, y2=0, y3=8] [L36] COND TRUE counter++<10 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=4, x1=11, x2=1, y1=3, y2=0, y3=8] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=4, x1=11, x2=1, y1=3, y2=0, y3=8] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=4, x1=11, x2=1, y1=4, y2=0, y3=7] [L36] EXPR counter++ VAL [\old(counter)=0, counter=5, counter++=4, x1=11, x2=1, y1=4, y2=0, y3=7] [L36] COND TRUE counter++<10 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=5, x1=11, x2=1, y1=4, y2=0, y3=7] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=5, x1=11, x2=1, y1=4, y2=0, y3=7] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=5, x1=11, x2=1, y1=5, y2=0, y3=6] [L36] EXPR counter++ VAL [\old(counter)=0, counter=6, counter++=5, x1=11, x2=1, y1=5, y2=0, y3=6] [L36] COND TRUE counter++<10 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=6] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=6] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=6, x1=11, x2=1, y1=5, y2=0, y3=6] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=6, x1=11, x2=1, y1=5, y2=0, y3=6] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=6, x1=11, x2=1, y1=6, y2=0, y3=5] [L36] EXPR counter++ VAL [\old(counter)=0, counter=7, counter++=6, x1=11, x2=1, y1=6, y2=0, y3=5] [L36] COND TRUE counter++<10 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=7, x1=11, x2=1, y1=6, y2=0, y3=5] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=7, x1=11, x2=1, y1=6, y2=0, y3=5] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=7, x1=11, x2=1, y1=7, y2=0, y3=4] [L36] EXPR counter++ VAL [\old(counter)=0, counter=8, counter++=7, x1=11, x2=1, y1=7, y2=0, y3=4] [L36] COND TRUE counter++<10 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=8, x1=11, x2=1, y1=7, y2=0, y3=4] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=8, x1=11, x2=1, y1=7, y2=0, y3=4] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=8, x1=11, x2=1, y1=8, y2=0, y3=3] [L36] EXPR counter++ VAL [\old(counter)=0, counter=9, counter++=8, x1=11, x2=1, y1=8, y2=0, y3=3] [L36] COND TRUE counter++<10 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=9, x1=11, x2=1, y1=8, y2=0, y3=3] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=9, x1=11, x2=1, y1=8, y2=0, y3=3] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=9, x1=11, x2=1, y1=9, y2=0, y3=2] [L36] EXPR counter++ VAL [\old(counter)=0, counter=10, counter++=9, x1=11, x2=1, y1=9, y2=0, y3=2] [L36] COND TRUE counter++<10 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=10, x1=11, x2=1, y1=9, y2=0, y3=2] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=10, x1=11, x2=1, y1=9, 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=10, x1=11, x2=1, y1=10, y2=0, y3=1] [L36] EXPR counter++ VAL [\old(counter)=0, counter=11, counter++=10, x1=11, x2=1, y1=10, y2=0, y3=1] [L36] COND FALSE !(counter++<10) [L50] CALL __VERIFIER_assert(y1*x2 + y2 == x1) VAL [\old(cond)=0, \old(counter)=0, counter=11] [L16] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=11] [L18] reach_error() VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=11] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.9s, OverallIterations: 7, TraceHistogramMax: 11, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 253 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 249 mSDsluCounter, 612 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 449 mSDsCounter, 109 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 231 IncrementalHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 109 mSolverCounterUnsat, 163 mSDtfsCounter, 231 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 308 GetRequests, 255 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=110occurred in iteration=6, InterpolantAutomatonStates: 55, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 9 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 8.6s InterpolantComputationTime, 301 NumberOfCodeBlocks, 301 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 299 ConstructedInterpolants, 0 QuantifiedInterpolants, 699 SizeOfPredicates, 18 NumberOfNonLiveVariables, 591 ConjunctsInSsa, 49 ConjunctsInUnsatCore, 9 InterpolantComputations, 3 PerfectInterpolantSequences, 82/188 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-27 14:18:49,693 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...