/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/Mono1_1-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-b030c9e [2022-03-20 03:52:37,490 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-20 03:52:37,492 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-20 03:52:37,519 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-20 03:52:37,520 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-20 03:52:37,521 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-20 03:52:37,522 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-20 03:52:37,523 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-20 03:52:37,524 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-20 03:52:37,525 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-20 03:52:37,526 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-20 03:52:37,527 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-20 03:52:37,527 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-20 03:52:37,528 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-20 03:52:37,529 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-20 03:52:37,529 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-20 03:52:37,530 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-20 03:52:37,531 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-20 03:52:37,532 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-20 03:52:37,533 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-20 03:52:37,534 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-03-20 03:52:37,535 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-20 03:52:37,536 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-20 03:52:37,537 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-20 03:52:37,537 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-20 03:52:37,539 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-20 03:52:37,539 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-20 03:52:37,540 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-20 03:52:37,540 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-20 03:52:37,541 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-20 03:52:37,541 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-20 03:52:37,541 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-20 03:52:37,542 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-20 03:52:37,543 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-20 03:52:37,543 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-20 03:52:37,544 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-20 03:52:37,544 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-20 03:52:37,545 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-20 03:52:37,545 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-20 03:52:37,545 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-20 03:52:37,546 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-20 03:52:37,552 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-20 03:52:37,553 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-03-20 03:52:37,560 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-20 03:52:37,561 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-20 03:52:37,562 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-20 03:52:37,562 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-20 03:52:37,562 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-20 03:52:37,562 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-20 03:52:37,563 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-20 03:52:37,563 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-20 03:52:37,569 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-20 03:52:37,570 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-20 03:52:37,570 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-20 03:52:37,570 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-20 03:52:37,570 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-20 03:52:37,570 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-20 03:52:37,570 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-20 03:52:37,571 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-20 03:52:37,571 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-20 03:52:37,571 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-20 03:52:37,571 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-20 03:52:37,571 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-20 03:52:37,571 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-20 03:52:37,572 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-03-20 03:52:37,572 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-03-20 03:52:37,790 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-20 03:52:37,814 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-20 03:52:37,816 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-20 03:52:37,816 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-20 03:52:37,818 INFO L275 PluginConnector]: CDTParser initialized [2022-03-20 03:52:37,819 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/Mono1_1-1.c [2022-03-20 03:52:37,882 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e861ac87/b086c64853fb4b7c9d46041625872e45/FLAGeec954c32 [2022-03-20 03:52:38,222 INFO L306 CDTParser]: Found 1 translation units. [2022-03-20 03:52:38,223 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/Mono1_1-1.c [2022-03-20 03:52:38,227 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e861ac87/b086c64853fb4b7c9d46041625872e45/FLAGeec954c32 [2022-03-20 03:52:38,656 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e861ac87/b086c64853fb4b7c9d46041625872e45 [2022-03-20 03:52:38,658 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-20 03:52:38,659 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-20 03:52:38,662 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-20 03:52:38,662 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-20 03:52:38,666 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-20 03:52:38,666 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.03 03:52:38" (1/1) ... [2022-03-20 03:52:38,667 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d60073 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 03:52:38, skipping insertion in model container [2022-03-20 03:52:38,667 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.03 03:52:38" (1/1) ... [2022-03-20 03:52:38,673 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-20 03:52:38,686 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-20 03:52:38,843 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/Mono1_1-1.c[313,326] [2022-03-20 03:52:38,856 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-20 03:52:38,866 INFO L203 MainTranslator]: Completed pre-run [2022-03-20 03:52:38,877 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/Mono1_1-1.c[313,326] [2022-03-20 03:52:38,880 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-20 03:52:38,890 INFO L208 MainTranslator]: Completed translation [2022-03-20 03:52:38,891 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 03:52:38 WrapperNode [2022-03-20 03:52:38,891 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-20 03:52:38,892 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-20 03:52:38,892 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-20 03:52:38,893 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-20 03:52:38,903 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 03:52:38" (1/1) ... [2022-03-20 03:52:38,903 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 03:52:38" (1/1) ... [2022-03-20 03:52:38,910 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 03:52:38" (1/1) ... [2022-03-20 03:52:38,910 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 03:52:38" (1/1) ... [2022-03-20 03:52:38,915 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 03:52:38" (1/1) ... [2022-03-20 03:52:38,918 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 03:52:38" (1/1) ... [2022-03-20 03:52:38,921 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 03:52:38" (1/1) ... [2022-03-20 03:52:38,922 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-20 03:52:38,923 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-20 03:52:38,923 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-20 03:52:38,923 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-20 03:52:38,927 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 03:52:38" (1/1) ... [2022-03-20 03:52:38,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-20 03:52:38,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 03:52:38,952 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-03-20 03:52:38,956 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-03-20 03:52:38,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-03-20 03:52:38,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-20 03:52:38,983 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-03-20 03:52:38,984 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-03-20 03:52:38,984 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-03-20 03:52:38,984 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-03-20 03:52:38,984 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-03-20 03:52:38,984 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-03-20 03:52:38,984 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-20 03:52:38,984 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-03-20 03:52:38,984 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-03-20 03:52:38,985 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-03-20 03:52:38,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-20 03:52:38,985 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-20 03:52:38,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-20 03:52:38,985 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-20 03:52:38,985 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-20 03:52:39,028 INFO L234 CfgBuilder]: Building ICFG [2022-03-20 03:52:39,029 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-20 03:52:39,103 INFO L275 CfgBuilder]: Performing block encoding [2022-03-20 03:52:39,107 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-20 03:52:39,108 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-03-20 03:52:39,109 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 03:52:39 BoogieIcfgContainer [2022-03-20 03:52:39,109 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-20 03:52:39,110 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-03-20 03:52:39,110 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-03-20 03:52:39,111 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-03-20 03:52:39,115 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 03:52:39" (1/1) ... [2022-03-20 03:52:39,117 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-03-20 03:52:39,126 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 20.03 03:52:39 BasicIcfg [2022-03-20 03:52:39,126 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-03-20 03:52:39,129 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-20 03:52:39,129 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-20 03:52:39,131 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-20 03:52:39,131 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.03 03:52:38" (1/4) ... [2022-03-20 03:52:39,132 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f1179dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.03 03:52:39, skipping insertion in model container [2022-03-20 03:52:39,132 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 03:52:38" (2/4) ... [2022-03-20 03:52:39,133 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f1179dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.03 03:52:39, skipping insertion in model container [2022-03-20 03:52:39,133 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 03:52:39" (3/4) ... [2022-03-20 03:52:39,133 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f1179dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.03 03:52:39, skipping insertion in model container [2022-03-20 03:52:39,133 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 20.03 03:52:39" (4/4) ... [2022-03-20 03:52:39,134 INFO L111 eAbstractionObserver]: Analyzing ICFG Mono1_1-1.cJordan [2022-03-20 03:52:39,139 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-03-20 03:52:39,139 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-20 03:52:39,178 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-20 03:52:39,184 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-03-20 03:52:39,185 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-03-20 03:52:39,198 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-03-20 03:52:39,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-20 03:52:39,210 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 03:52:39,211 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 03:52:39,211 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 03:52:39,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 03:52:39,227 INFO L85 PathProgramCache]: Analyzing trace with hash -756157467, now seen corresponding path program 1 times [2022-03-20 03:52:39,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 03:52:39,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500092082] [2022-03-20 03:52:39,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 03:52:39,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 03:52:39,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 03:52:39,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 03:52:39,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 03:52:39,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 03:52:39,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 03:52:39,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500092082] [2022-03-20 03:52:39,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500092082] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 03:52:39,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 03:52:39,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-20 03:52:39,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114368511] [2022-03-20 03:52:39,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 03:52:39,441 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-20 03:52:39,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 03:52:39,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-20 03:52:39,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-20 03:52:39,463 INFO L87 Difference]: Start difference. First operand has 19 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 03:52:39,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 03:52:39,491 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2022-03-20 03:52:39,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-20 03:52:39,493 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-03-20 03:52:39,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 03:52:39,513 INFO L225 Difference]: With dead ends: 19 [2022-03-20 03:52:39,513 INFO L226 Difference]: Without dead ends: 13 [2022-03-20 03:52:39,514 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-03-20 03:52:39,517 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 11 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-20 03:52:39,518 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 22 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-20 03:52:39,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-03-20 03:52:39,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-03-20 03:52:39,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 03:52:39,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2022-03-20 03:52:39,547 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2022-03-20 03:52:39,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 03:52:39,548 INFO L478 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2022-03-20 03:52:39,549 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 03:52:39,549 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-03-20 03:52:39,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-20 03:52:39,549 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 03:52:39,550 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 03:52:39,550 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-20 03:52:39,550 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 03:52:39,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 03:52:39,554 INFO L85 PathProgramCache]: Analyzing trace with hash -755233946, now seen corresponding path program 1 times [2022-03-20 03:52:39,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 03:52:39,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954031143] [2022-03-20 03:52:39,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 03:52:39,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 03:52:39,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 03:52:39,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 03:52:39,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 03:52:39,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 03:52:39,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 03:52:39,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954031143] [2022-03-20 03:52:39,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954031143] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 03:52:39,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 03:52:39,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 03:52:39,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009062676] [2022-03-20 03:52:39,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 03:52:39,661 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 03:52:39,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 03:52:39,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 03:52:39,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 03:52:39,662 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 03:52:39,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 03:52:39,712 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-03-20 03:52:39,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 03:52:39,713 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-03-20 03:52:39,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 03:52:39,714 INFO L225 Difference]: With dead ends: 15 [2022-03-20 03:52:39,714 INFO L226 Difference]: Without dead ends: 15 [2022-03-20 03:52:39,714 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-20 03:52:39,716 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 10 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-20 03:52:39,716 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 19 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-20 03:52:39,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-03-20 03:52:39,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-03-20 03:52:39,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 03:52:39,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-03-20 03:52:39,724 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 11 [2022-03-20 03:52:39,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 03:52:39,724 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-03-20 03:52:39,724 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 03:52:39,725 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-03-20 03:52:39,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-20 03:52:39,726 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 03:52:39,729 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 03:52:39,730 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-20 03:52:39,730 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 03:52:39,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 03:52:39,731 INFO L85 PathProgramCache]: Analyzing trace with hash 980092676, now seen corresponding path program 1 times [2022-03-20 03:52:39,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 03:52:39,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569116359] [2022-03-20 03:52:39,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 03:52:39,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 03:52:39,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 03:52:39,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 03:52:39,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 03:52:39,831 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 03:52:39,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 03:52:39,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569116359] [2022-03-20 03:52:39,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569116359] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 03:52:39,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1915753774] [2022-03-20 03:52:39,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 03:52:39,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 03:52:39,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 03:52:39,835 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-03-20 03:52:39,836 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-03-20 03:52:39,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 03:52:39,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-20 03:52:39,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 03:52:39,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 03:52:39,997 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 03:52:40,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 03:52:40,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1915753774] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 03:52:40,082 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 03:52:40,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-03-20 03:52:40,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56118764] [2022-03-20 03:52:40,086 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 03:52:40,087 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-20 03:52:40,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 03:52:40,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-20 03:52:40,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-03-20 03:52:40,088 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 03:52:40,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 03:52:40,225 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-03-20 03:52:40,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-20 03:52:40,225 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-03-20 03:52:40,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 03:52:40,226 INFO L225 Difference]: With dead ends: 19 [2022-03-20 03:52:40,226 INFO L226 Difference]: Without dead ends: 19 [2022-03-20 03:52:40,226 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2022-03-20 03:52:40,227 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 12 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 03:52:40,228 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 38 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 03:52:40,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-03-20 03:52:40,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2022-03-20 03:52:40,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 03:52:40,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2022-03-20 03:52:40,231 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2022-03-20 03:52:40,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 03:52:40,231 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2022-03-20 03:52:40,231 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 03:52:40,231 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-03-20 03:52:40,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-20 03:52:40,232 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 03:52:40,232 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 03:52:40,258 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-03-20 03:52:40,432 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 03:52:40,433 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 03:52:40,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 03:52:40,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1575643231, now seen corresponding path program 1 times [2022-03-20 03:52:40,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 03:52:40,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305639947] [2022-03-20 03:52:40,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 03:52:40,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 03:52:40,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 03:52:40,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 03:52:40,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 03:52:40,544 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 03:52:40,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 03:52:40,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305639947] [2022-03-20 03:52:40,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305639947] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 03:52:40,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1088215577] [2022-03-20 03:52:40,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 03:52:40,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 03:52:40,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 03:52:40,548 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-03-20 03:52:40,552 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-03-20 03:52:40,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 03:52:40,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-20 03:52:40,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 03:52:40,711 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 03:52:40,712 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 03:52:40,842 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 03:52:40,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1088215577] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 03:52:40,842 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 03:52:40,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 11 [2022-03-20 03:52:40,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437561981] [2022-03-20 03:52:40,845 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 03:52:40,846 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-20 03:52:40,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 03:52:40,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-20 03:52:40,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-03-20 03:52:40,849 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 03:52:41,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 03:52:41,088 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2022-03-20 03:52:41,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-20 03:52:41,089 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-03-20 03:52:41,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 03:52:41,090 INFO L225 Difference]: With dead ends: 26 [2022-03-20 03:52:41,090 INFO L226 Difference]: Without dead ends: 26 [2022-03-20 03:52:41,090 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=200, Unknown=0, NotChecked=0, Total=306 [2022-03-20 03:52:41,091 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 20 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 03:52:41,091 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 29 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 03:52:41,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-03-20 03:52:41,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-03-20 03:52:41,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 03:52:41,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2022-03-20 03:52:41,095 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 17 [2022-03-20 03:52:41,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 03:52:41,095 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2022-03-20 03:52:41,096 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 03:52:41,096 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2022-03-20 03:52:41,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-20 03:52:41,096 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 03:52:41,096 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 03:52:41,118 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-03-20 03:52:41,315 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-03-20 03:52:41,316 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 03:52:41,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 03:52:41,316 INFO L85 PathProgramCache]: Analyzing trace with hash 109985751, now seen corresponding path program 2 times [2022-03-20 03:52:41,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 03:52:41,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810385814] [2022-03-20 03:52:41,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 03:52:41,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 03:52:41,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 03:52:41,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 03:52:41,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 03:52:41,515 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 03:52:41,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 03:52:41,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810385814] [2022-03-20 03:52:41,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810385814] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 03:52:41,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1447813728] [2022-03-20 03:52:41,516 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-20 03:52:41,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 03:52:41,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 03:52:41,517 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-03-20 03:52:41,540 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-03-20 03:52:41,560 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-20 03:52:41,560 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 03:52:41,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 20 conjunts are in the unsatisfiable core [2022-03-20 03:52:41,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 03:52:41,689 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 03:52:41,689 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 03:52:42,070 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 03:52:42,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1447813728] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 03:52:42,070 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 03:52:42,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 13] total 23 [2022-03-20 03:52:42,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417798496] [2022-03-20 03:52:42,071 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 03:52:42,071 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-20 03:52:42,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 03:52:42,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-20 03:52:42,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 [2022-03-20 03:52:42,072 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand has 23 states, 22 states have (on average 2.0) internal successors, (44), 21 states have internal predecessors, (44), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 03:52:43,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 03:52:43,398 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-03-20 03:52:43,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-20 03:52:43,399 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.0) internal successors, (44), 21 states have internal predecessors, (44), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-03-20 03:52:43,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 03:52:43,401 INFO L225 Difference]: With dead ends: 39 [2022-03-20 03:52:43,401 INFO L226 Difference]: Without dead ends: 36 [2022-03-20 03:52:43,402 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=311, Invalid=1095, Unknown=0, NotChecked=0, Total=1406 [2022-03-20 03:52:43,403 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 34 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-20 03:52:43,403 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 66 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-20 03:52:43,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-03-20 03:52:43,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-03-20 03:52:43,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 03:52:43,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2022-03-20 03:52:43,408 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 25 [2022-03-20 03:52:43,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 03:52:43,408 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2022-03-20 03:52:43,408 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.0) internal successors, (44), 21 states have internal predecessors, (44), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 03:52:43,408 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-03-20 03:52:43,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-03-20 03:52:43,409 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 03:52:43,409 INFO L499 BasicCegarLoop]: trace histogram [12, 7, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 03:52:43,434 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-03-20 03:52:43,634 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 03:52:43,634 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 03:52:43,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 03:52:43,635 INFO L85 PathProgramCache]: Analyzing trace with hash 134643049, now seen corresponding path program 3 times [2022-03-20 03:52:43,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 03:52:43,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426493565] [2022-03-20 03:52:43,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 03:52:43,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 03:52:43,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 03:52:43,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 03:52:43,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 03:52:43,824 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 72 proven. 56 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-03-20 03:52:43,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 03:52:43,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426493565] [2022-03-20 03:52:43,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426493565] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 03:52:43,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1877200567] [2022-03-20 03:52:43,825 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-20 03:52:43,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 03:52:43,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 03:52:43,826 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-03-20 03:52:43,836 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-03-20 03:52:43,926 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2022-03-20 03:52:43,926 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 03:52:43,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 21 conjunts are in the unsatisfiable core [2022-03-20 03:52:43,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 03:52:44,179 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 77 proven. 25 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-03-20 03:52:44,179 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 03:52:44,817 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 77 proven. 25 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-03-20 03:52:44,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1877200567] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 03:52:44,817 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 03:52:44,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 12] total 27 [2022-03-20 03:52:44,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899331115] [2022-03-20 03:52:44,818 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 03:52:44,819 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-20 03:52:44,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 03:52:44,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-20 03:52:44,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=527, Unknown=0, NotChecked=0, Total=702 [2022-03-20 03:52:44,820 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 27 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 25 states have internal predecessors, (55), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 03:52:52,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 03:52:52,479 INFO L93 Difference]: Finished difference Result 57 states and 69 transitions. [2022-03-20 03:52:52,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-03-20 03:52:52,480 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 25 states have internal predecessors, (55), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-03-20 03:52:52,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 03:52:52,480 INFO L225 Difference]: With dead ends: 57 [2022-03-20 03:52:52,480 INFO L226 Difference]: Without dead ends: 54 [2022-03-20 03:52:52,482 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=699, Invalid=2381, Unknown=0, NotChecked=0, Total=3080 [2022-03-20 03:52:52,482 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 91 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-20 03:52:52,483 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 56 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-20 03:52:52,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-03-20 03:52:52,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2022-03-20 03:52:52,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 47 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 03:52:52,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2022-03-20 03:52:52,488 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 35 [2022-03-20 03:52:52,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 03:52:52,488 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2022-03-20 03:52:52,488 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 25 states have internal predecessors, (55), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 03:52:52,488 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2022-03-20 03:52:52,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-03-20 03:52:52,489 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 03:52:52,489 INFO L499 BasicCegarLoop]: trace histogram [20, 12, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 03:52:52,503 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-03-20 03:52:52,690 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 03:52:52,690 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 03:52:52,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 03:52:52,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1228107086, now seen corresponding path program 4 times [2022-03-20 03:52:52,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 03:52:52,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966797741] [2022-03-20 03:52:52,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 03:52:52,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 03:52:52,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 03:52:52,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 03:52:52,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 03:52:52,886 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 207 proven. 72 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-03-20 03:52:52,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 03:52:52,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966797741] [2022-03-20 03:52:52,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966797741] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 03:52:52,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1661486116] [2022-03-20 03:52:52,890 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-20 03:52:52,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 03:52:52,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 03:52:52,896 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-03-20 03:52:52,931 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-03-20 03:52:52,958 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-20 03:52:52,959 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 03:52:52,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 34 conjunts are in the unsatisfiable core [2022-03-20 03:52:52,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 03:52:53,249 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 144 proven. 240 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-03-20 03:52:53,249 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 03:52:54,099 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 144 proven. 240 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-03-20 03:52:54,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1661486116] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 03:52:54,100 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 03:52:54,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 18, 19] total 37 [2022-03-20 03:52:54,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030429913] [2022-03-20 03:52:54,100 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 03:52:54,100 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-03-20 03:52:54,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 03:52:54,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-03-20 03:52:54,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=370, Invalid=962, Unknown=0, NotChecked=0, Total=1332 [2022-03-20 03:52:54,102 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand has 37 states, 37 states have (on average 2.108108108108108) internal successors, (78), 36 states have internal predecessors, (78), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 03:53:19,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 03:53:19,921 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2022-03-20 03:53:19,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-20 03:53:19,922 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.108108108108108) internal successors, (78), 36 states have internal predecessors, (78), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2022-03-20 03:53:19,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 03:53:19,922 INFO L225 Difference]: With dead ends: 86 [2022-03-20 03:53:19,923 INFO L226 Difference]: Without dead ends: 86 [2022-03-20 03:53:19,924 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 78 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 26.1s TimeCoverageRelationStatistics Valid=1061, Invalid=2845, Unknown=0, NotChecked=0, Total=3906 [2022-03-20 03:53:19,924 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 58 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-20 03:53:19,924 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 99 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-20 03:53:19,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-03-20 03:53:19,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2022-03-20 03:53:19,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 81 states have (on average 1.0987654320987654) internal successors, (89), 81 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 03:53:19,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 93 transitions. [2022-03-20 03:53:19,932 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 93 transitions. Word has length 51 [2022-03-20 03:53:19,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 03:53:19,933 INFO L478 AbstractCegarLoop]: Abstraction has 86 states and 93 transitions. [2022-03-20 03:53:19,933 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.108108108108108) internal successors, (78), 36 states have internal predecessors, (78), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 03:53:19,933 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2022-03-20 03:53:19,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-03-20 03:53:19,935 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 03:53:19,935 INFO L499 BasicCegarLoop]: trace histogram [37, 25, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 03:53:19,954 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-03-20 03:53:20,147 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 03:53:20,148 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 03:53:20,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 03:53:20,148 INFO L85 PathProgramCache]: Analyzing trace with hash 525547056, now seen corresponding path program 5 times [2022-03-20 03:53:20,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 03:53:20,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637720240] [2022-03-20 03:53:20,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 03:53:20,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 03:53:20,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 03:53:20,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 03:53:20,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 03:53:20,691 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 598 proven. 650 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-03-20 03:53:20,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 03:53:20,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637720240] [2022-03-20 03:53:20,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637720240] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 03:53:20,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [317671142] [2022-03-20 03:53:20,692 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-20 03:53:20,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 03:53:20,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 03:53:20,693 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-03-20 03:53:20,694 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-03-20 03:53:29,125 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 38 check-sat command(s) [2022-03-20 03:53:29,125 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 03:53:29,131 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 60 conjunts are in the unsatisfiable core [2022-03-20 03:53:29,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 03:53:29,529 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 493 proven. 812 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-03-20 03:53:29,529 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 03:53:31,654 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 493 proven. 812 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-03-20 03:53:31,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [317671142] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 03:53:31,654 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 03:53:31,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 31, 32] total 63 [2022-03-20 03:53:31,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880627506] [2022-03-20 03:53:31,654 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 03:53:31,655 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-03-20 03:53:31,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 03:53:31,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-03-20 03:53:31,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1050, Invalid=2856, Unknown=0, NotChecked=0, Total=3906 [2022-03-20 03:53:31,657 INFO L87 Difference]: Start difference. First operand 86 states and 93 transitions. Second operand has 63 states, 63 states have (on average 2.0634920634920637) internal successors, (130), 62 states have internal predecessors, (130), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 03:53:55,361 WARN L232 SmtUtils]: Spent 7.35s on a formula simplification. DAG size of input: 209 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-20 03:54:22,189 WARN L232 SmtUtils]: Spent 10.51s on a formula simplification. DAG size of input: 202 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-20 03:54:48,626 WARN L232 SmtUtils]: Spent 6.79s on a formula simplification. DAG size of input: 195 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-20 03:55:20,458 WARN L232 SmtUtils]: Spent 7.39s on a formula simplification. DAG size of input: 188 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-20 04:00:05,802 WARN L232 SmtUtils]: Spent 22.22s on a formula simplification. DAG size of input: 212 DAG size of output: 23 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-20 04:00:05,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:00:05,872 INFO L93 Difference]: Finished difference Result 146 states and 153 transitions. [2022-03-20 04:00:05,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-03-20 04:00:05,873 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 2.0634920634920637) internal successors, (130), 62 states have internal predecessors, (130), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 85 [2022-03-20 04:00:05,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:00:05,874 INFO L225 Difference]: With dead ends: 146 [2022-03-20 04:00:05,874 INFO L226 Difference]: Without dead ends: 146 [2022-03-20 04:00:05,877 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 137 SyntacticMatches, 2 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1691 ImplicationChecksByTransitivity, 395.4s TimeCoverageRelationStatistics Valid=3726, Invalid=10308, Unknown=8, NotChecked=0, Total=14042 [2022-03-20 04:00:05,877 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 118 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 1730 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 1956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 1730 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-20 04:00:05,878 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 164 Invalid, 1956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 1730 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-20 04:00:05,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-03-20 04:00:05,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2022-03-20 04:00:05,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 141 states have (on average 1.0567375886524824) internal successors, (149), 141 states have internal predecessors, (149), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 04:00:05,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 153 transitions. [2022-03-20 04:00:05,890 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 153 transitions. Word has length 85 [2022-03-20 04:00:05,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:00:05,890 INFO L478 AbstractCegarLoop]: Abstraction has 146 states and 153 transitions. [2022-03-20 04:00:05,892 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 2.0634920634920637) internal successors, (130), 62 states have internal predecessors, (130), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 04:00:05,892 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 153 transitions. [2022-03-20 04:00:05,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-03-20 04:00:05,894 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:00:05,894 INFO L499 BasicCegarLoop]: trace histogram [67, 55, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:00:05,901 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-03-20 04:00:06,099 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:00:06,100 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:00:06,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:00:06,100 INFO L85 PathProgramCache]: Analyzing trace with hash 729081652, now seen corresponding path program 6 times [2022-03-20 04:00:06,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:00:06,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869560053] [2022-03-20 04:00:06,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:00:06,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:00:06,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:00:07,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:00:07,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:00:07,776 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 1288 proven. 3080 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-03-20 04:00:07,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:00:07,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869560053] [2022-03-20 04:00:07,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869560053] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 04:00:07,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236507980] [2022-03-20 04:00:07,778 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-20 04:00:07,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:00:07,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:00:07,779 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 04:00:07,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-03-20 04:00:26,017 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 51 check-sat command(s) [2022-03-20 04:00:26,018 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 04:00:26,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 45 conjunts are in the unsatisfiable core [2022-03-20 04:00:26,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 04:00:27,747 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 1375 proven. 144 refuted. 0 times theorem prover too weak. 2970 trivial. 0 not checked. [2022-03-20 04:00:27,747 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 04:00:30,622 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 1375 proven. 144 refuted. 0 times theorem prover too weak. 2970 trivial. 0 not checked. [2022-03-20 04:00:30,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1236507980] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 04:00:30,623 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 04:00:30,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 15, 19] total 89 [2022-03-20 04:00:30,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188638819] [2022-03-20 04:00:30,623 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 04:00:30,624 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 89 states [2022-03-20 04:00:30,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:00:30,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2022-03-20 04:00:30,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1264, Invalid=6568, Unknown=0, NotChecked=0, Total=7832 [2022-03-20 04:00:30,627 INFO L87 Difference]: Start difference. First operand 146 states and 153 transitions. Second operand has 89 states, 88 states have (on average 2.034090909090909) internal successors, (179), 87 states have internal predecessors, (179), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 04:01:12,939 WARN L232 SmtUtils]: Spent 20.55s on a formula simplification. DAG size of input: 98 DAG size of output: 96 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-20 04:01:35,061 WARN L232 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 92 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-20 04:01:57,065 WARN L232 SmtUtils]: Spent 11.19s on a formula simplification. DAG size of input: 91 DAG size of output: 89 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-20 04:02:23,725 WARN L232 SmtUtils]: Spent 6.97s on a formula simplification. DAG size of input: 84 DAG size of output: 82 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-20 04:02:47,722 WARN L232 SmtUtils]: Spent 5.48s on a formula simplification. DAG size of input: 77 DAG size of output: 75 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-20 04:03:59,180 WARN L232 SmtUtils]: Spent 9.42s on a formula simplification that was a NOOP. DAG size: 97 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-20 04:03:59,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:03:59,246 INFO L93 Difference]: Finished difference Result 179 states and 204 transitions. [2022-03-20 04:03:59,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2022-03-20 04:03:59,247 INFO L78 Accepts]: Start accepts. Automaton has has 89 states, 88 states have (on average 2.034090909090909) internal successors, (179), 87 states have internal predecessors, (179), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 145 [2022-03-20 04:03:59,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:03:59,248 INFO L225 Difference]: With dead ends: 179 [2022-03-20 04:03:59,248 INFO L226 Difference]: Without dead ends: 176 [2022-03-20 04:03:59,253 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 461 GetRequests, 275 SyntacticMatches, 2 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4768 ImplicationChecksByTransitivity, 196.4s TimeCoverageRelationStatistics Valid=4979, Invalid=29431, Unknown=0, NotChecked=0, Total=34410 [2022-03-20 04:03:59,254 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 342 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 9206 mSolverCounterSat, 873 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 10079 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 873 IncrementalHoareTripleChecker+Valid, 9206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.2s IncrementalHoareTripleChecker+Time [2022-03-20 04:03:59,254 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [342 Valid, 126 Invalid, 10079 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [873 Valid, 9206 Invalid, 0 Unknown, 0 Unchecked, 17.2s Time] [2022-03-20 04:03:59,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2022-03-20 04:03:59,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2022-03-20 04:03:59,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 171 states have (on average 1.087719298245614) internal successors, (186), 171 states have internal predecessors, (186), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 04:03:59,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 190 transitions. [2022-03-20 04:03:59,262 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 190 transitions. Word has length 145 [2022-03-20 04:03:59,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:03:59,263 INFO L478 AbstractCegarLoop]: Abstraction has 176 states and 190 transitions. [2022-03-20 04:03:59,263 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 89 states, 88 states have (on average 2.034090909090909) internal successors, (179), 87 states have internal predecessors, (179), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 04:03:59,263 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 190 transitions. [2022-03-20 04:03:59,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-03-20 04:03:59,265 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:03:59,265 INFO L499 BasicCegarLoop]: trace histogram [82, 56, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:03:59,275 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-03-20 04:03:59,475 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:03:59,475 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:03:59,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:03:59,476 INFO L85 PathProgramCache]: Analyzing trace with hash -2146523672, now seen corresponding path program 7 times [2022-03-20 04:03:59,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:03:59,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089092133] [2022-03-20 04:03:59,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:03:59,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:03:59,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:04:01,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:04:01,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:04:01,125 INFO L134 CoverageAnalysis]: Checked inductivity of 6724 backedges. 2907 proven. 3192 refuted. 0 times theorem prover too weak. 625 trivial. 0 not checked. [2022-03-20 04:04:01,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:04:01,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089092133] [2022-03-20 04:04:01,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089092133] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 04:04:01,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1916586195] [2022-03-20 04:04:01,126 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-20 04:04:01,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:04:01,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:04:01,128 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 04:04:01,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-03-20 04:04:01,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:04:01,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 156 conjunts are in the unsatisfiable core [2022-03-20 04:04:01,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 04:04:02,898 INFO L134 CoverageAnalysis]: Checked inductivity of 6724 backedges. 847 proven. 5852 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-03-20 04:04:02,899 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 04:04:14,642 INFO L134 CoverageAnalysis]: Checked inductivity of 6724 backedges. 847 proven. 5852 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-03-20 04:04:14,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1916586195] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 04:04:14,642 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 04:04:14,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 79, 80] total 159 [2022-03-20 04:04:14,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081374901] [2022-03-20 04:04:14,643 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 04:04:14,643 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 159 states [2022-03-20 04:04:14,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:04:14,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 159 interpolants. [2022-03-20 04:04:14,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6457, Invalid=18665, Unknown=0, NotChecked=0, Total=25122 [2022-03-20 04:04:14,646 INFO L87 Difference]: Start difference. First operand 176 states and 190 transitions. Second operand has 159 states, 159 states have (on average 2.0251572327044025) internal successors, (322), 158 states have internal predecessors, (322), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 04:04:21,346 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ c_main_~x~0 79) 4294967296))) (or (not (< .cse0 100000000)) (< .cse0 10000000))) (let ((.cse1 (mod (+ 94 c_main_~x~0) 4294967296))) (or (not (< .cse1 100000000)) (< .cse1 10000000))) (let ((.cse2 (mod (+ 62 c_main_~x~0) 4294967296))) (or (< .cse2 10000000) (not (< .cse2 100000000)))) (= |c_#NULL.base| |c_old(#NULL.base)|) (let ((.cse3 (mod (+ c_main_~x~0 93) 4294967296))) (or (< .cse3 10000000) (not (< .cse3 100000000)))) (let ((.cse4 (mod (+ 8 c_main_~x~0) 4294967296))) (or (< .cse4 10000000) (not (< .cse4 100000000)))) (let ((.cse5 (mod (+ 60 c_main_~x~0) 4294967296))) (or (< .cse5 10000000) (not (< .cse5 100000000)))) (let ((.cse6 (mod (+ 18 c_main_~x~0) 4294967296))) (or (not (< .cse6 100000000)) (< .cse6 10000000))) (let ((.cse7 (mod (+ 34 c_main_~x~0) 4294967296))) (or (not (< .cse7 100000000)) (< .cse7 10000000))) (let ((.cse8 (mod (+ 44 c_main_~x~0) 4294967296))) (or (< .cse8 10000000) (not (< .cse8 100000000)))) (let ((.cse9 (mod (+ 22 c_main_~x~0) 4294967296))) (or (not (< .cse9 100000000)) (< .cse9 10000000))) (let ((.cse10 (mod (+ 10 c_main_~x~0) 4294967296))) (or (< .cse10 10000000) (not (< .cse10 100000000)))) (let ((.cse11 (mod (+ 41 c_main_~x~0) 4294967296))) (or (not (< .cse11 100000000)) (< .cse11 10000000))) (let ((.cse12 (mod (+ 78 c_main_~x~0) 4294967296))) (or (< .cse12 10000000) (not (< .cse12 100000000)))) (let ((.cse13 (mod (+ 57 c_main_~x~0) 4294967296))) (or (< .cse13 10000000) (not (< .cse13 100000000)))) (let ((.cse14 (mod (+ 90 c_main_~x~0) 4294967296))) (or (< .cse14 10000000) (not (< .cse14 100000000)))) (let ((.cse15 (mod (+ 88 c_main_~x~0) 4294967296))) (or (< .cse15 10000000) (not (< .cse15 100000000)))) (let ((.cse16 (mod (+ 48 c_main_~x~0) 4294967296))) (or (not (< .cse16 100000000)) (< .cse16 10000000))) (let ((.cse17 (mod (+ 46 c_main_~x~0) 4294967296))) (or (not (< .cse17 100000000)) (< .cse17 10000000))) (let ((.cse18 (mod (+ c_main_~x~0 75) 4294967296))) (or (< .cse18 10000000) (not (< .cse18 100000000)))) (let ((.cse19 (mod (+ c_main_~x~0 80) 4294967296))) (or (not (< .cse19 100000000)) (< .cse19 10000000))) (let ((.cse20 (mod (+ c_main_~x~0 54) 4294967296))) (or (< .cse20 10000000) (not (< .cse20 100000000)))) (let ((.cse21 (mod (+ 66 c_main_~x~0) 4294967296))) (or (not (< .cse21 100000000)) (< .cse21 10000000))) (let ((.cse22 (mod (+ 74 c_main_~x~0) 4294967296))) (or (< .cse22 10000000) (not (< .cse22 100000000)))) (let ((.cse23 (mod (+ 42 c_main_~x~0) 4294967296))) (or (not (< .cse23 100000000)) (< .cse23 10000000))) (let ((.cse24 (mod (+ 84 c_main_~x~0) 4294967296))) (or (not (< .cse24 100000000)) (< .cse24 10000000))) (let ((.cse25 (mod (+ c_main_~x~0 86) 4294967296))) (or (not (< .cse25 100000000)) (< .cse25 10000000))) (let ((.cse26 (mod (+ c_main_~x~0 50) 4294967296))) (or (< .cse26 10000000) (not (< .cse26 100000000)))) (let ((.cse27 (mod (+ 68 c_main_~x~0) 4294967296))) (or (not (< .cse27 100000000)) (< .cse27 10000000))) (let ((.cse28 (mod (+ 82 c_main_~x~0) 4294967296))) (or (< .cse28 10000000) (not (< .cse28 100000000)))) (let ((.cse29 (mod (+ 52 c_main_~x~0) 4294967296))) (or (< .cse29 10000000) (not (< .cse29 100000000)))) (let ((.cse30 (mod (+ 67 c_main_~x~0) 4294967296))) (or (not (< .cse30 100000000)) (< .cse30 10000000))) (let ((.cse31 (mod (+ 16 c_main_~x~0) 4294967296))) (or (< .cse31 10000000) (not (< .cse31 100000000)))) (let ((.cse32 (mod (+ 64 c_main_~x~0) 4294967296))) (or (< .cse32 10000000) (not (< .cse32 100000000)))) (let ((.cse33 (mod (+ 36 c_main_~x~0) 4294967296))) (or (< .cse33 10000000) (not (< .cse33 100000000)))) (let ((.cse34 (mod (+ c_main_~x~0 61) 4294967296))) (or (< .cse34 10000000) (not (< .cse34 100000000)))) (let ((.cse35 (mod (+ 76 c_main_~x~0) 4294967296))) (or (< .cse35 10000000) (not (< .cse35 100000000)))) (let ((.cse36 (mod (+ 55 c_main_~x~0) 4294967296))) (or (not (< .cse36 100000000)) (< .cse36 10000000))) (let ((.cse37 (mod (+ 87 c_main_~x~0) 4294967296))) (or (not (< .cse37 100000000)) (< .cse37 10000000))) (let ((.cse38 (mod (+ 45 c_main_~x~0) 4294967296))) (or (< .cse38 10000000) (not (< .cse38 100000000)))) (let ((.cse39 (mod (+ 38 c_main_~x~0) 4294967296))) (or (not (< .cse39 100000000)) (< .cse39 10000000))) (let ((.cse40 (mod (+ 4 c_main_~x~0) 4294967296))) (or (< .cse40 10000000) (not (< .cse40 100000000)))) (let ((.cse41 (mod (+ 53 c_main_~x~0) 4294967296))) (or (not (< .cse41 100000000)) (< .cse41 10000000))) (let ((.cse42 (mod (+ 70 c_main_~x~0) 4294967296))) (or (not (< .cse42 100000000)) (< .cse42 10000000))) (let ((.cse43 (mod (+ c_main_~x~0 83) 4294967296))) (or (< .cse43 10000000) (not (< .cse43 100000000)))) (let ((.cse44 (mod (+ 6 c_main_~x~0) 4294967296))) (or (< .cse44 10000000) (not (< .cse44 100000000)))) (let ((.cse45 (mod (+ 92 c_main_~x~0) 4294967296))) (or (not (< .cse45 100000000)) (< .cse45 10000000))) (let ((.cse46 (mod (+ 89 c_main_~x~0) 4294967296))) (or (< .cse46 10000000) (not (< .cse46 100000000)))) (let ((.cse47 (mod (+ 49 c_main_~x~0) 4294967296))) (or (not (< .cse47 100000000)) (< .cse47 10000000))) (let ((.cse48 (mod (+ 59 c_main_~x~0) 4294967296))) (or (not (< .cse48 100000000)) (< .cse48 10000000))) (let ((.cse49 (mod (+ 65 c_main_~x~0) 4294967296))) (or (not (< .cse49 100000000)) (< .cse49 10000000))) (let ((.cse50 (mod (+ 43 c_main_~x~0) 4294967296))) (or (not (< .cse50 100000000)) (< .cse50 10000000))) (let ((.cse51 (mod (+ 14 c_main_~x~0) 4294967296))) (or (not (< .cse51 100000000)) (< .cse51 10000000))) (let ((.cse52 (mod (+ 56 c_main_~x~0) 4294967296))) (or (not (< .cse52 100000000)) (< .cse52 10000000))) (let ((.cse53 (mod (+ 47 c_main_~x~0) 4294967296))) (or (not (< .cse53 100000000)) (< .cse53 10000000))) (let ((.cse54 (mod (+ 69 c_main_~x~0) 4294967296))) (or (< .cse54 10000000) (not (< .cse54 100000000)))) (let ((.cse55 (mod (+ 12 c_main_~x~0) 4294967296))) (or (< .cse55 10000000) (not (< .cse55 100000000)))) (let ((.cse56 (mod (+ 81 c_main_~x~0) 4294967296))) (or (< .cse56 10000000) (not (< .cse56 100000000)))) (let ((.cse57 (mod (+ 72 c_main_~x~0) 4294967296))) (or (< .cse57 10000000) (not (< .cse57 100000000)))) (let ((.cse58 (mod (+ 28 c_main_~x~0) 4294967296))) (or (< .cse58 10000000) (not (< .cse58 100000000)))) (let ((.cse59 (mod (+ 58 c_main_~x~0) 4294967296))) (or (< .cse59 10000000) (not (< .cse59 100000000)))) (let ((.cse60 (mod (+ 26 c_main_~x~0) 4294967296))) (or (not (< .cse60 100000000)) (< .cse60 10000000))) (let ((.cse61 (mod (+ 32 c_main_~x~0) 4294967296))) (or (not (< .cse61 100000000)) (< .cse61 10000000))) (let ((.cse62 (mod (+ 73 c_main_~x~0) 4294967296))) (or (not (< .cse62 100000000)) (< .cse62 10000000))) (let ((.cse63 (mod (+ 63 c_main_~x~0) 4294967296))) (or (< .cse63 10000000) (not (< .cse63 100000000)))) (let ((.cse64 (mod (+ 2 c_main_~x~0) 4294967296))) (or (< .cse64 10000000) (not (< .cse64 100000000)))) (let ((.cse65 (mod (+ 85 c_main_~x~0) 4294967296))) (or (< .cse65 10000000) (not (< .cse65 100000000)))) (let ((.cse66 (mod (+ 77 c_main_~x~0) 4294967296))) (or (not (< .cse66 100000000)) (< .cse66 10000000))) (let ((.cse67 (mod (+ 95 c_main_~x~0) 4294967296))) (or (< .cse67 10000000) (not (< .cse67 100000000)))) (let ((.cse68 (mod (+ 20 c_main_~x~0) 4294967296))) (or (not (< .cse68 100000000)) (< .cse68 10000000))) (let ((.cse69 (mod (+ 30 c_main_~x~0) 4294967296))) (or (< .cse69 10000000) (not (< .cse69 100000000)))) (let ((.cse70 (mod (+ c_main_~x~0 96) 4294967296))) (or (not (< .cse70 100000000)) (< .cse70 10000000))) (let ((.cse71 (mod (+ 71 c_main_~x~0) 4294967296))) (or (not (< .cse71 100000000)) (< .cse71 10000000))) (let ((.cse72 (mod (+ 51 c_main_~x~0) 4294967296))) (or (not (< .cse72 100000000)) (< .cse72 10000000))) (let ((.cse73 (mod (+ c_main_~x~0 24) 4294967296))) (or (not (< .cse73 100000000)) (< .cse73 10000000))) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (< (mod c_main_~x~0 4294967296) 10000000) (let ((.cse74 (mod (+ 40 c_main_~x~0) 4294967296))) (or (< .cse74 10000000) (not (< .cse74 100000000)))) (let ((.cse75 (mod (+ 91 c_main_~x~0) 4294967296))) (or (< .cse75 10000000) (not (< .cse75 100000000))))) is different from false [2022-03-20 04:04:23,367 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ c_main_~x~0 79) 4294967296))) (or (not (< .cse0 100000000)) (< .cse0 10000000))) (let ((.cse1 (mod (+ 94 c_main_~x~0) 4294967296))) (or (not (< .cse1 100000000)) (< .cse1 10000000))) (let ((.cse2 (mod (+ 62 c_main_~x~0) 4294967296))) (or (< .cse2 10000000) (not (< .cse2 100000000)))) (let ((.cse3 (mod (+ c_main_~x~0 93) 4294967296))) (or (< .cse3 10000000) (not (< .cse3 100000000)))) (let ((.cse4 (mod (+ 8 c_main_~x~0) 4294967296))) (or (< .cse4 10000000) (not (< .cse4 100000000)))) (let ((.cse5 (mod (+ 60 c_main_~x~0) 4294967296))) (or (< .cse5 10000000) (not (< .cse5 100000000)))) (let ((.cse6 (mod (+ 18 c_main_~x~0) 4294967296))) (or (not (< .cse6 100000000)) (< .cse6 10000000))) (let ((.cse7 (mod (+ 34 c_main_~x~0) 4294967296))) (or (not (< .cse7 100000000)) (< .cse7 10000000))) (let ((.cse8 (mod (+ 44 c_main_~x~0) 4294967296))) (or (< .cse8 10000000) (not (< .cse8 100000000)))) (let ((.cse9 (mod (+ 22 c_main_~x~0) 4294967296))) (or (not (< .cse9 100000000)) (< .cse9 10000000))) (let ((.cse10 (mod (+ 10 c_main_~x~0) 4294967296))) (or (< .cse10 10000000) (not (< .cse10 100000000)))) (let ((.cse11 (mod (+ 41 c_main_~x~0) 4294967296))) (or (not (< .cse11 100000000)) (< .cse11 10000000))) (let ((.cse12 (mod (+ 78 c_main_~x~0) 4294967296))) (or (< .cse12 10000000) (not (< .cse12 100000000)))) (let ((.cse13 (mod (+ 57 c_main_~x~0) 4294967296))) (or (< .cse13 10000000) (not (< .cse13 100000000)))) (let ((.cse14 (mod (+ 90 c_main_~x~0) 4294967296))) (or (< .cse14 10000000) (not (< .cse14 100000000)))) (let ((.cse15 (mod (+ 88 c_main_~x~0) 4294967296))) (or (< .cse15 10000000) (not (< .cse15 100000000)))) (let ((.cse16 (mod (+ 48 c_main_~x~0) 4294967296))) (or (not (< .cse16 100000000)) (< .cse16 10000000))) (let ((.cse17 (mod (+ 46 c_main_~x~0) 4294967296))) (or (not (< .cse17 100000000)) (< .cse17 10000000))) (let ((.cse18 (mod (+ c_main_~x~0 75) 4294967296))) (or (< .cse18 10000000) (not (< .cse18 100000000)))) (let ((.cse19 (mod (+ c_main_~x~0 80) 4294967296))) (or (not (< .cse19 100000000)) (< .cse19 10000000))) (let ((.cse20 (mod (+ c_main_~x~0 54) 4294967296))) (or (< .cse20 10000000) (not (< .cse20 100000000)))) (let ((.cse21 (mod (+ 66 c_main_~x~0) 4294967296))) (or (not (< .cse21 100000000)) (< .cse21 10000000))) (let ((.cse22 (mod (+ 74 c_main_~x~0) 4294967296))) (or (< .cse22 10000000) (not (< .cse22 100000000)))) (let ((.cse23 (mod (+ 42 c_main_~x~0) 4294967296))) (or (not (< .cse23 100000000)) (< .cse23 10000000))) (let ((.cse24 (mod (+ 84 c_main_~x~0) 4294967296))) (or (not (< .cse24 100000000)) (< .cse24 10000000))) (let ((.cse25 (mod (+ c_main_~x~0 86) 4294967296))) (or (not (< .cse25 100000000)) (< .cse25 10000000))) (let ((.cse26 (mod (+ c_main_~x~0 50) 4294967296))) (or (< .cse26 10000000) (not (< .cse26 100000000)))) (let ((.cse27 (mod (+ 68 c_main_~x~0) 4294967296))) (or (not (< .cse27 100000000)) (< .cse27 10000000))) (let ((.cse28 (mod (+ 82 c_main_~x~0) 4294967296))) (or (< .cse28 10000000) (not (< .cse28 100000000)))) (let ((.cse29 (mod (+ 52 c_main_~x~0) 4294967296))) (or (< .cse29 10000000) (not (< .cse29 100000000)))) (let ((.cse30 (mod (+ 67 c_main_~x~0) 4294967296))) (or (not (< .cse30 100000000)) (< .cse30 10000000))) (let ((.cse31 (mod (+ 16 c_main_~x~0) 4294967296))) (or (< .cse31 10000000) (not (< .cse31 100000000)))) (let ((.cse32 (mod (+ 64 c_main_~x~0) 4294967296))) (or (< .cse32 10000000) (not (< .cse32 100000000)))) (let ((.cse33 (mod (+ 36 c_main_~x~0) 4294967296))) (or (< .cse33 10000000) (not (< .cse33 100000000)))) (let ((.cse34 (mod (+ c_main_~x~0 61) 4294967296))) (or (< .cse34 10000000) (not (< .cse34 100000000)))) (let ((.cse35 (mod (+ 76 c_main_~x~0) 4294967296))) (or (< .cse35 10000000) (not (< .cse35 100000000)))) (let ((.cse36 (mod (+ 55 c_main_~x~0) 4294967296))) (or (not (< .cse36 100000000)) (< .cse36 10000000))) (let ((.cse37 (mod (+ 87 c_main_~x~0) 4294967296))) (or (not (< .cse37 100000000)) (< .cse37 10000000))) (let ((.cse38 (mod (+ 45 c_main_~x~0) 4294967296))) (or (< .cse38 10000000) (not (< .cse38 100000000)))) (let ((.cse39 (mod (+ 38 c_main_~x~0) 4294967296))) (or (not (< .cse39 100000000)) (< .cse39 10000000))) (let ((.cse40 (mod (+ 4 c_main_~x~0) 4294967296))) (or (< .cse40 10000000) (not (< .cse40 100000000)))) (let ((.cse41 (mod (+ 53 c_main_~x~0) 4294967296))) (or (not (< .cse41 100000000)) (< .cse41 10000000))) (let ((.cse42 (mod (+ 70 c_main_~x~0) 4294967296))) (or (not (< .cse42 100000000)) (< .cse42 10000000))) (let ((.cse43 (mod (+ c_main_~x~0 83) 4294967296))) (or (< .cse43 10000000) (not (< .cse43 100000000)))) (let ((.cse44 (mod (+ 6 c_main_~x~0) 4294967296))) (or (< .cse44 10000000) (not (< .cse44 100000000)))) (let ((.cse45 (mod (+ 92 c_main_~x~0) 4294967296))) (or (not (< .cse45 100000000)) (< .cse45 10000000))) (let ((.cse46 (mod (+ 89 c_main_~x~0) 4294967296))) (or (< .cse46 10000000) (not (< .cse46 100000000)))) (let ((.cse47 (mod (+ 49 c_main_~x~0) 4294967296))) (or (not (< .cse47 100000000)) (< .cse47 10000000))) (let ((.cse48 (mod (+ 59 c_main_~x~0) 4294967296))) (or (not (< .cse48 100000000)) (< .cse48 10000000))) (let ((.cse49 (mod (+ 65 c_main_~x~0) 4294967296))) (or (not (< .cse49 100000000)) (< .cse49 10000000))) (let ((.cse50 (mod (+ 43 c_main_~x~0) 4294967296))) (or (not (< .cse50 100000000)) (< .cse50 10000000))) (let ((.cse51 (mod (+ 14 c_main_~x~0) 4294967296))) (or (not (< .cse51 100000000)) (< .cse51 10000000))) (let ((.cse52 (mod (+ 56 c_main_~x~0) 4294967296))) (or (not (< .cse52 100000000)) (< .cse52 10000000))) (let ((.cse53 (mod (+ 47 c_main_~x~0) 4294967296))) (or (not (< .cse53 100000000)) (< .cse53 10000000))) (let ((.cse54 (mod (+ 69 c_main_~x~0) 4294967296))) (or (< .cse54 10000000) (not (< .cse54 100000000)))) (let ((.cse55 (mod (+ 12 c_main_~x~0) 4294967296))) (or (< .cse55 10000000) (not (< .cse55 100000000)))) (let ((.cse56 (mod (+ 81 c_main_~x~0) 4294967296))) (or (< .cse56 10000000) (not (< .cse56 100000000)))) (let ((.cse57 (mod (+ 72 c_main_~x~0) 4294967296))) (or (< .cse57 10000000) (not (< .cse57 100000000)))) (let ((.cse58 (mod (+ 28 c_main_~x~0) 4294967296))) (or (< .cse58 10000000) (not (< .cse58 100000000)))) (let ((.cse59 (mod (+ 58 c_main_~x~0) 4294967296))) (or (< .cse59 10000000) (not (< .cse59 100000000)))) (let ((.cse60 (mod (+ 26 c_main_~x~0) 4294967296))) (or (not (< .cse60 100000000)) (< .cse60 10000000))) (let ((.cse61 (mod (+ 32 c_main_~x~0) 4294967296))) (or (not (< .cse61 100000000)) (< .cse61 10000000))) (let ((.cse62 (mod (+ 73 c_main_~x~0) 4294967296))) (or (not (< .cse62 100000000)) (< .cse62 10000000))) (let ((.cse63 (mod (+ 63 c_main_~x~0) 4294967296))) (or (< .cse63 10000000) (not (< .cse63 100000000)))) (let ((.cse64 (mod (+ 2 c_main_~x~0) 4294967296))) (or (< .cse64 10000000) (not (< .cse64 100000000)))) (let ((.cse65 (mod (+ 85 c_main_~x~0) 4294967296))) (or (< .cse65 10000000) (not (< .cse65 100000000)))) (let ((.cse66 (mod (+ 77 c_main_~x~0) 4294967296))) (or (not (< .cse66 100000000)) (< .cse66 10000000))) (let ((.cse67 (mod (+ 95 c_main_~x~0) 4294967296))) (or (< .cse67 10000000) (not (< .cse67 100000000)))) (let ((.cse68 (mod (+ 20 c_main_~x~0) 4294967296))) (or (not (< .cse68 100000000)) (< .cse68 10000000))) (let ((.cse69 (mod (+ 30 c_main_~x~0) 4294967296))) (or (< .cse69 10000000) (not (< .cse69 100000000)))) (let ((.cse70 (mod (+ c_main_~x~0 96) 4294967296))) (or (not (< .cse70 100000000)) (< .cse70 10000000))) (let ((.cse71 (mod (+ 71 c_main_~x~0) 4294967296))) (or (not (< .cse71 100000000)) (< .cse71 10000000))) (let ((.cse72 (mod (+ 51 c_main_~x~0) 4294967296))) (or (not (< .cse72 100000000)) (< .cse72 10000000))) (let ((.cse73 (mod (+ c_main_~x~0 24) 4294967296))) (or (not (< .cse73 100000000)) (< .cse73 10000000))) (< (mod c_main_~x~0 4294967296) 10000000) (let ((.cse74 (mod (+ 40 c_main_~x~0) 4294967296))) (or (< .cse74 10000000) (not (< .cse74 100000000)))) (let ((.cse75 (mod (+ 91 c_main_~x~0) 4294967296))) (or (< .cse75 10000000) (not (< .cse75 100000000))))) is different from false